Method and apparatus of indicating aggregation number in a wireless communication system

ABSTRACT

A User Equipment (UE) receives a message including a first parameter indicative of a list of entries associated with time resource allocation for multiple PUSCHs. The list does not include a third parameter for configuring a number of repetitions. The UE does not expect the message to include a second parameter that configures and/or indicates an aggregation factor. The UE receives a Downlink Control Information (DCI) indicative of a first entry in the list. The UE performs one or more transmissions on one or more time occasions. A number of time occasions of the one or more time occasions is based on a number of time resource allocations of the first entry.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims priority to and is a continuation of U.S.application Ser. No. 17/545,465, filed on Dec. 8, 2021, entitled “METHODAND APPARATUS OF INDICATING AGGREGATION NUMBER IN A WIRELESSCOMMUNICATION SYSTEM”, the entire disclosure of which is incorporatedherein in its entirety by reference. U.S. application Ser. No.17/545,465 claims the benefit of U.S. Provisional Patent ApplicationSer. No. 63/122,599 filed on Dec. 8, 2020, the entire disclosure ofwhich is incorporated herein in its entirety by reference.

FIELD

This disclosure generally relates to wireless communication networks,and more particularly, to a method and apparatus of indicatingaggregation number in a wireless communication system.

BACKGROUND

With the rapid rise in demand for communication of large amounts of datato and from mobile communication devices, traditional mobile voicecommunication networks are evolving into networks that communicate withInternet Protocol (IP) data packets. Such IP data packet communicationcan provide users of mobile communication devices with voice over IP,multimedia, multicast and on-demand communication services.

An exemplary network structure is an Evolved Universal Terrestrial RadioAccess Network (E-UTRAN). The E-UTRAN system can provide high datathroughput in order to realize the above-noted voice over IP andmultimedia services. A new radio technology for the next generation(e.g., 5G) is currently being discussed by the 3GPP standardsorganization. Accordingly, changes to the current body of 3GPP standardare currently being submitted and considered to evolve and finalize the3GPP standard.

SUMMARY

In accordance with the present disclosure, one or more devices and/ormethods are provided. In an example from the perspective of a UserEquipment (UE), the UE receives a message associated with PhysicalUplink Shared Channel (PUSCH) parameter configuration. The messagecomprises a first parameter indicative of a list of entries associatedwith time resource allocation for multiple PUSCHs. The list of entriesdoes not comprise a third parameter for configuring a number ofrepetitions. The UE does not expect the message to comprise a secondparameter that configures and/or indicates an aggregation factor. The UEreceives a Downlink Control Information (DCI) indicative of a firstentry in the list, wherein the first entry is indicative of one or moretime resource allocations. The UE performs one or more transmissions onone or more time occasions, wherein a number of time occasions of theone or more time occasions is based on a number of time resourceallocations of the one or more time resource allocations.

In an example from the perspective of a network, the network transmits,to a UE, a message associated with PUSCH parameter configuration. Thenetwork is not allowed to concurrently include both a first parameterand a second parameter in the message. The message comprises either thefirst parameter or the second parameter. The first parameter isindicative of a list of entries associated with time resource allocationfor multiple PUSCHs. The list of entries does not comprise a thirdparameter for configuring a number of repetitions. The second parameterconfigures and/or indicates an aggregation factor. The network transmitsa DCI indicative of a first entry in the list, wherein the first entryis indicative of one or more time resource allocations. The networkperforms one or more receptions on one or more time occasions, wherein anumber of time occasions of the one or more time occasions is based on anumber of time resource allocations of the one or more time resourceallocations.

In an example from the perspective of a UE, the UE receives a messageassociated with PUSCH parameter configuration. The message comprises afirst parameter, a second parameter and a third parameter. The firstparameter is indicative of a first list of entries associated with timeresource allocation for multiple PUSCHs. The second parameter indicatestransmission of multiple repetitions for a single PUSCH. The thirdparameter is indicative of a second list of entries associated with timeresource allocation. Each entry in the second list is indicative of asingle time resource allocation. The first list, the second list and/orthe second parameter are used for determining a repetition number. Ifthe UE receives a first DCI indicative of a first entry in the firstlist, the UE transmits a plurality of PUSCHs based on a plurality oftime resource allocations indicated by the first entry, wherein a firstrepetition number for the plurality of PUSCHs is determined to be one.If the UE receives a second DCI indicative of a second entry in thesecond list, the UE transmits one or more PUSCHs with repetition basedon a single time resource allocation indicated by the second entry,wherein a second repetition number for the one or more PUSCHs isdetermined based on the second parameter.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a diagram of a wireless communication system according toone exemplary embodiment.

FIG. 2 is a block diagram of a transmitter system (also known as accessnetwork) and a receiver system (also known as user equipment or UE)according to one exemplary embodiment.

FIG. 3 is a functional block diagram of a communication system accordingto one exemplary embodiment.

FIG. 4 is a functional block diagram of the program code of FIG. 3according to one exemplary embodiment.

FIG. 5 is a diagram illustrating associations of Start and LengthIndicator Values (SLIVs), starting orthogonal frequency-divisionmultiplexing (OFDM) symbols and lengths, according to one exemplaryembodiment.

FIG. 6 illustrates a list for resource allocation for Physical UplinkShared Channel (PUSCH), according to one exemplary embodiment.

FIG. 7 is a diagram illustrating an exemplary scenario associated withimplementation of multi-PUSCHs functionality, according to one exemplaryembodiment.

FIG. 8 is a diagram illustrating an exemplary scenario associated withPUSCH aggregation/repetition functionality, according to one exemplaryembodiment.

FIG. 9 is a diagram illustrating one or more operations associated withdetermining a pattern, according to one exemplary embodiment.

FIG. 10 is a diagram illustrating one or more operations associated withdetermining a pattern, according to one exemplary embodiment.

FIG. 11 is a diagram illustrating examples of a pattern, according toone exemplary embodiment.

FIG. 12 is a diagram illustrating one or more operations associated withdetermining a pattern, according to one exemplary embodiment.

FIG. 13 is a diagram illustrating examples of a pattern, according toone exemplary embodiment.

FIG. 14 is a diagram illustrating examples of a pattern, according toone exemplary embodiment.

FIG. 15 is a diagram illustrating examples of a pattern, according toone exemplary embodiment.

FIG. 16 is a diagram illustrating examples of a pattern, according toone exemplary embodiment.

FIG. 17 is a table associated with example scenarios associated withdetermining a repetition number/aggregation number, according to oneexemplary embodiment.

FIG. 18 is a flow chart according to one exemplary embodiment.

FIG. 19 is a flow chart according to one exemplary embodiment.

FIG. 20 is a flow chart according to one exemplary embodiment.

FIG. 21 is a flow chart according to one exemplary embodiment.

FIG. 22 is a flow chart according to one exemplary embodiment.

DETAILED DESCRIPTION

The exemplary wireless communication systems and devices described belowemploy a wireless communication system, supporting a broadcast service.Wireless communication systems are widely deployed to provide varioustypes of communication such as voice, data, and so on. These systems maybe based on code division multiple access (CDMA), time division multipleaccess (TDMA), orthogonal frequency division multiple access (OFDMA),3^(rd) Generation Partnership Project (3GPP) LTE (Long Term Evolution)wireless access, 3GPP LTE-A or LTE-Advanced (Long Term EvolutionAdvanced), 3GPP2 UMB (Ultra Mobile Broadband), WiMax, 3GPP NR (NewRadio) wireless access for 5G, or some other modulation techniques.

In particular, the exemplary wireless communication systems devicesdescribed below may be designed to support one or more standards such asthe standard offered by a consortium named “3rd Generation PartnershipProject” referred to herein as 3GPP, including: RP-193196; 3GPP TS38.212 V16.3.0 (2020 September), “3GPP TSG RAN; NR Physical channels andmodulation (Release 16)”; 3GPP TS 38.213 V16.3.0 (2020 September), “3GPPTSG RAN; NR Physical channels and modulation (Release 16)”; 3GPP TS38.214 V16.3.0 (2020 September), “3GPP TSG RAN; NR Physical channels andmodulation (Release 16)”; 3GPP TS 38.331 V16.2.0 (2020 September), “3GPPTSG RAN; NR Radio Resource Control (RRC) protocol specification (Release16)”; 3GPP TS 37.213 V16.3.0 (2020 September), “3GPP TSG RAN; NRPhysical layer procedures for shared spectrum channel access (Release16)”. The standards and documents listed above are hereby expresslyincorporated by reference in their entirety.

FIG. 1 presents a multiple access wireless communication system inaccordance with one or more embodiments of the disclosure. An accessnetwork 100 (AN) includes multiple antenna groups, one including 104 and106, another including 108 and 110, and an additional including 112 and114. In FIG. 1, only two antennas are shown for each antenna group,however, more or fewer antennas may be utilized for each antenna group.Access terminal 116 (AT) is in communication with antennas 112 and 114,where antennas 112 and 114 transmit information to access terminal 116over forward link 120 and receive information from access terminal 116over reverse link 118. AT 122 is in communication with antennas 106 and108, where antennas 106 and 108 transmit information to AT 122 overforward link 126 and receive information from AT 122 over reverse link124. In a frequency-division duplexing (FDD) system, communication links118, 120, 124 and 126 may use different frequencies for communication.For example, forward link 120 may use a different frequency than thatused by reverse link 118.

Each group of antennas and/or the area in which they are designed tocommunicate is often referred to as a sector of the access network. Inthe embodiment, antenna groups each may be designed to communicate toaccess terminals in a sector of the areas covered by access network 100.

In communication over forward links 120 and 126, the transmittingantennas of access network 100 may utilize beamforming in order toimprove the signal-to-noise ratio of forward links for the differentaccess terminals 116 and 122. Also, an access network using beamformingto transmit to access terminals scattered randomly through its coveragemay normally cause less interference to access terminals in neighboringcells than an access network transmitting through a single antenna toits access terminals.

An access network (AN) may be a fixed station or base station used forcommunicating with the terminals and may also be referred to as anaccess point, a Node B, a base station, an enhanced base station, aneNodeB (eNB), a Next Generation NodeB (gNB), or some other terminology.An access terminal (AT) may also be called user equipment (UE), awireless communication device, terminal, access terminal or some otherterminology.

FIG. 2 presents an embodiment of a transmitter system 210 (also known asthe access network) and a receiver system 250 (also known as accessterminal (AT) or user equipment (UE)) in a multiple-input andmultiple-output (MIMO) system 200. At the transmitter system 210,traffic data for a number of data streams may be provided from a datasource 212 to a transmit (TX) data processor 214.

In one embodiment, each data stream is transmitted over a respectivetransmit antenna. TX data processor 214 formats, codes, and interleavesthe traffic data for each data stream based on a particular codingscheme selected for that data stream to provide coded data.

The coded data for each data stream may be multiplexed with pilot datausing orthogonal frequency-division multiplexing (OFDM) techniques. Thepilot data may typically be a known data pattern that is processed in aknown manner and may be used at the receiver system to estimate thechannel response. The multiplexed pilot and coded data for each datastream may then be modulated (i.e., symbol mapped) based on a particularmodulation scheme (e.g., binary phase shift keying (BPSK), quadraturephase shift keying (QPSK), M-ary phase shift keying (M-PSK), or M-aryquadrature amplitude modulation (M-QAM)) selected for that data streamto provide modulation symbols. The data rate, coding, and/or modulationfor each data stream may be determined by instructions performed byprocessor 230.

The modulation symbols for data streams are then provided to a TX MIMOprocessor 220, which may further process the modulation symbols (e.g.,for OFDM). TX MIMO processor 220 then provides N_(T) modulation symbolstreams to N_(T) transmitters (TMTR) 222 a through 222 t. In certainembodiments, TX MIMO processor 220 may apply beamforming weights to thesymbols of the data streams and to the antenna from which the symbol isbeing transmitted.

Each transmitter 222 receives and processes a respective symbol streamto provide one or more analog signals, and further conditions (e.g.,amplifies, filters, and/or upconverts) the analog signals to provide amodulated signal suitable for transmission over the MIMO channel. N_(T)modulated signals from transmitters 222 a through 222 t may then betransmitted from N_(T) antennas 224 a through 224 t, respectively.

At receiver system 250, the transmitted modulated signals are receivedby N_(R) antennas 252 a through 252 r and the received signal from eachantenna 252 may be provided to a respective receiver (RCVR) 254 athrough 254 r. Each receiver 254 may condition (e.g., filters,amplifies, and downconverts) a respective received signal, digitize theconditioned signal to provide samples, and/or further process thesamples to provide a corresponding “received” symbol stream.

An RX data processor 260 then receives and/or processes the N_(R)received symbol streams from N_(R) receivers 254 based on a particularreceiver processing technique to provide N_(T) “detected” symbolstreams. The RX data processor 260 may then demodulate, deinterleave,and/or decode each detected symbol stream to recover the traffic datafor the data stream. The processing by RX data processor 260 may becomplementary to that performed by TX MIMO processor 220 and TX dataprocessor 214 at transmitter system 210.

A processor 270 may periodically determine which pre-coding matrix touse (discussed below). Processor 270 formulates a reverse link messagecomprising a matrix index portion and a rank value portion.

The reverse link message may comprise various types of informationregarding the communication link and/or the received data stream. Thereverse link message may then be processed by a TX data processor 238,which may also receive traffic data for a number of data streams from adata source 236, modulated by a modulator 280, conditioned bytransmitters 254 a through 254 r, and/or transmitted back to transmittersystem 210.

At transmitter system 210, the modulated signals from receiver system250 are received by antennas 224, conditioned by receivers 222,demodulated by a demodulator 240, and processed by a RX data processor242 to extract the reserve link message transmitted by the receiversystem 250. Processor 230 may then determine which pre-coding matrix touse for determining the beamforming weights and may then process theextracted message.

FIG. 3 presents an alternative simplified functional block diagram of acommunication device according to one embodiment of the disclosedsubject matter. As shown in FIG. 3, the communication device 300 in awireless communication system can be utilized for realizing the UEs (orATs) 116 and 122 in FIG. 1 or the base station (or AN) 100 in FIG. 1,and the wireless communications system may be the LTE system or the NRsystem. The communication device 300 may include an input device 302, anoutput device 304, a control circuit 306, a central processing unit(CPU) 308, a memory 310, a program code 312, and a transceiver 314. Thecontrol circuit 306 executes the program code 312 in the memory 310through the CPU 308, thereby controlling an operation of thecommunications device 300. The communications device 300 can receivesignals input by a user through the input device 302, such as a keyboardor keypad, and can output images and sounds through the output device304, such as a monitor or speakers. The transceiver 314 is used toreceive and transmit wireless signals, delivering received signals tothe control circuit 306, and outputting signals generated by the controlcircuit 306 wirelessly. The communication device 300 in a wirelesscommunication system can also be utilized for realizing the AN 100 inFIG. 1.

FIG. 4 is a simplified block diagram of the program code 312 shown inFIG. 3 in accordance with one embodiment of the disclosed subjectmatter. In this embodiment, the program code 312 includes an applicationlayer 400, a Layer 3 portion 402, and a Layer 2 portion 404, and iscoupled to a Layer 1 portion 406. The Layer 3 portion 402 may performradio resource control. The Layer 2 portion 404 may perform linkcontrol. The Layer 1 portion 406 may perform and/or implement physicalconnections.

New Radio Unlicensed (NR-U) status report specifies 3GPP progress forNR-U from multiple working groups. One or more parts of the NR-U statusreport are quoted from RP-193196:

Agreement:

-   -   The TDRA table configuration allows indicating single or        multiple continuous PUSCHs in any slot of the multiple scheduled        slots    -   For signaling the number of scheduled PUSCHs and TDRA in one DCI        format 0_1 scheduling multiple PUSCHs, the TDRA table is        extended such that each row indicates multiple PUSCHs        (continuous in time-domain)        -   Each PUSCH has a separate SLIV and mapping type. The number            of scheduled PUSCHs is signalled by the number of indicated            valid SLIVs in the row of the TDRA table signalled in DCI.    -   Note: For the fallback DCI, Rel-15 TDRA table is used

Downlink Control Information (DCI) formats are discussed in 3GPP TS38.212 V16.3.0, one or more parts of which are quoted below:

7.3.1.1.2 Format 0_1

DCI format 0_1 is used for the scheduling of one or multiple PUSCH inone cell, or indicating CG downlink feedback information (CG-DFI) to aUE.The following information is transmitted by means of the DCI format 0_1with CRC scrambled by C-RNTI or CS-RNTI or SP-CSI-RNTI or MCS-C-RNTI:

-   -   Identifier for DCI formats—1 bit        -   The value of this bit field is always set to 0, indicating            an UL DCI format    -   Carrier indicator—0 or 3 bits, as defined in Clause 10.1 of [5,        TS38.213].    -   DFI flag—0 or 1 bit        If DCI format 0_1 is used for indicating CG-DFI, . . . .        Otherwise, all the remaining fields are set as follows:    -   UL/SUL indicator—0 bit.    -   Bandwidth part indicator—0, 1 or 2 bits    -   Frequency domain resource assignment—number of bits determined        by the following, where N_(RB) ^(UL,BWP) is the size of the        active UL bandwidth part:        -   If higher layer parameter useInterlacePUCCH-PUSCH in            BWP-UplinkDedicated is not configured            -   N_(RBG) bits if only resource allocation type 0 is                configured, where N_(RBG) is defined in Clause 6.1.2.2.1                of [6, TS 38.214],            -   ┌log₂(N_(RB) ^(UL,BWP)(N_(RB) ^(UL,BWP)+1)/2)┐ bits if                only resource allocation type 1 is configured, or                max(┌log₂(N_(RB) ^(UL,BWP)(N_(RB) ^(UL,BWP)+1)/2)┐,                N_(RBG))+1 bits if both resource allocation type 0 and 1                are configured.            -   If both resource allocation type 0 and 1 are configured,                the MSB bit is used to indicate resource allocation type                0 or resource allocation type 1, where the bit value of                0 indicates resource allocation type 0 and the bit value                of 1 indicates resource allocation type 1.        -   If the higher layer parameter useInterlacePUCCH-PUSCH in            BWP-UplinkDedicated is configured            -   5+Y bits provide the frequency domain resource                allocation according to Clause 6.1.2.2.3 of [6, TS                38.214] if the subcarrier spacing for the active UL                bandwidth part is 30 kHz. The 5 MSBs provide the                interlace allocation and the Y LSBs provide the RB set                allocation.            -   6+Y bits provide the frequency domain resource                allocation according to Clause 6.1.2.2.3 of [6, TS                38.214] if the subcarrier spacing for the active UL                bandwidth part is 15 kHz. The 6 MSBs provide the                interlace allocation and the Y LSBs provide the RB set                allocation.        -   The value of Y is determined by

$\left\lceil {\log_{2}\left( \frac{N_{{{RB} - {set}},{UL}}^{BWP}\left( {N_{{{RB} - {set}},{UL}}^{BWP} + 1} \right)}{2} \right)} \right\rceil$

where N_(RB-set,UL) ^(BWP) is the number of RB sets contained in theactive UL BWP as defined in clause 7 of [6, TS38.214].

-   -   Time domain resource assignment—0, 1, 2, 3, 4, 5, or 6 bits        -   If the higher layer parameter            PUSCH-TimeDomainResourceAllocationList-ForDCIformat0_1 is            not configured and if the higher layer parameter            pusch-TimeDomainAllocationListForMultiPUSCH is not            configured and if the higher layer parameter            pusch-TimeDomainAllocationList is configured, 0, 1, 2, 3, or            4 bits as defined in Clause 6.1.2.1 of [6, TS38.214]. The            bitwidth for this field is determined as ┌log₂(I)┐ bits,            where I is the number of entries in the higher layer            parameter pusch-TimeDomainAllocationList;        -   If the higher layer parameter            PUSCH-TimeDomainResourceAllocationList-ForDCIformat0_1 is            configured or if the higher layer parameter            pusch-TimeDomainAllocationListForMultiPUSCH is configured,            0, 1, 2, 3, 4, 5 or 6 bits as defined in Clause 6.1.2.1 of            [6, TS38.214]. The bitwidth for this field is determined as            ┌log₂(I)┐ bits, where I is the number of entries in the            higher layer parameter            PUSCH-TimeDomainResourceAllocationList-ForDCIformat0_1 or            pusch-TimeDomainAllocationListForMultiPUSCH;        -   otherwise the bitwidth for this field is determined as            ┌log₂(I)┐ bits, where I is the number of entries in the            default table.    -   Frequency hopping flag—0 or 1 bit:    -   Modulation and coding scheme—5 bits as defined in Clause 6.1.4.1        of [6, TS 38.214]    -   New data indicator—1 bit if the number of scheduled PUSCH        indicated by the Time domain resource assignment field is 1;        otherwise 2, 3, 4, 5, 6, 7 or 8 bits determined based on the        maximum number of schedulable PUSCH among all entries in the        higher layer parameter        pusch-TimeDomainAllocationListForMultiPUSCH, where each bit        corresponds to one scheduled PUSCH as defined in clause 6.1.4 in        [6, TS 38.214].    -   Redundancy version—number of bits determined by the following:        -   2 bits as defined in Table 7.3.1.1.1-2 if the number of            scheduled PUSCH indicated by the Time domain resource            assignment field is 1;        -   otherwise 2, 3, 4, 5, 6, 7 or 8 bits determined by the            maximum number of schedulable PUSCHs among all entries in            the higher layer parameter            pusch-TimeDomainAllocationListForMultiPUSCH, where each bit            corresponds to one scheduled PUSCH as defined in clause            6.1.4 in [6, TS 38.214] and redundancy version is determined            according to Table 7.3.1.1.2-34.    -   HARQ process number—4 bits    -   . . .    -   . . .    -   . . .    -   . . .    -   ChannelAccess-CPext-CAPC—0, 1, 2, 3, 4, 5 or 6 bits. The        bitwidth for this field is determined as ┌log₂(I)┐ bits, where I        is the number of entries in the higher layer parameter        ul-dci-triggered-UL-ChannelAccess-CPext-CAPC-r16 for operation        in a cell with shared spectrum channel access; otherwise 0 bit.        One or more entries from Table 7.3.1.1.2-35 are configured by        the higher layer parameter        ul-dci-triggered-UL-ChannelAccess-CPext-CAPC-r16.    -   . . . .

7.3.1.1.3 Format 0_2

DCI format 0_2 is used for the scheduling of PUSCH in one cell.The following information is transmitted by means of the DCI format 0_2with CRC scrambled by C-RNTI or CS-RNTI or SP-CSI-RNTI or MCS-C-RNTI:

-   -   Identifier for DCI formats—1 bit        -   The value of this bit field is always set to 0, indicating            an UL DCI format    -   Carrier indicator—0, 1, 2 or 3 bits determined by higher layer        parameter carrierIndicatorSizeForDCI-Format0-2, as defined in        Clause 10.1 of [5, TS38.213].    -   UL/SUL indicator—0 bit    -   Bandwidth part indicator—0, 1 or 2 bits    -   . . .    -   Time domain resource assignment—0, 1, 2, 3, 4, 5 or 6 bits as        defined in Clause 6.1.2.1 of [6, TS38.214]. The bitwidth for        this field is determined as ┌log₂(I)┐ bits, where I is the        number of entries in the higher layer parameter        PUSCH-TimeDomainResourceAllocationList-ForDCIformat0_2 if the        higher layer parameter is configured, or I is the number of        entries in the higher layer parameter        PUSCH-TimeDomainResourceAllocationList if the higher layer        parameter PUSCH-TimeDomainResourceAllocationList is configured        and the higher layer parameter        PUSCH-TimeDomainResourceAllocationList-ForDCIformat0_2 is not        configured; otherwise I is the number of entries in the default        table.    -   Frequency hopping flag—0 or 1 bit:    -   Modulation and coding scheme—5 bits as defined in Clause 6.1.4.1        of [6, TS 38.214]    -   New data indicator—1 bit    -   Redundancy version—0, 1 or 2 bits determined by higher layer        parameter numberOfBitsForRV-ForDCI-Format0-2        -   If 0 bit is configured, rv_(id) to be applied is 0;        -   1 bit according to Table 7.3.1.2.3-1;        -   2 bits according to Table 7.3.1.1.1-2.    -   HARQ process number—0, 1, 2, 3 or 4 bits determined by higher        layer parameter harq-ProcessNumberSizeForDCI-Format0-2

Resource allocation is discussed in 3GPP TS 38.214 V16.3.0, one or moreparts of which are quoted below:

6.1.2 Resource Allocation 6.1.2.1 Resource Allocation in Time Domain

When the UE is scheduled to transmit a transport block and no CSIreport, or the UE is scheduled to transmit a transport block and a CSIreport(s) on PUSCH by a DCI, the Time domain resource assignment fieldvalue m of the DCI provides a row index m+1 to an allocated table. Thedetermination of the used resource allocation table is defined in Clause6.1.2.1.1. The indexed row defines the slot offset K₂, the start andlength indicator SLIV, or directly the start symbol S and the allocationlength L, the PUSCH mapping type, and the number of repetitions (ifnumberOfRepetitions-r16 is present in the resource allocation table) tobe applied in the PUSCH transmission.

-   -   For PUSCH repetition Type A, the starting symbol S relative to        the start of the slot, and the number of consecutive symbols L        counting from the symbol S allocated for the PUSCH are        determined from the start and length indicator SLIV of the        indexed row:

if (L − 1) ≤ 7 then  SLIV = 14 · (L − 1) + S else  SLIV = 14 · (14 −L + 1) + (14 − 1 − S)

-   -   where 0<L≤14-S, and    -   For PUSCH repetition Type B, the starting symbol S relative to        the start of the slot, and the number of consecutive symbols L        counting from the symbol S allocated for the PUSCH are provided        by startSymbol-r16 and length-r16 of the indexed row of the        resource allocation table, respectively.    -   For PUSCH repetition Type A, the PUSCH mapping type is set to        Type A or Type B as defined in Clause 6.4.1.1.3 of [4, TS        38.211] as given by the indexed row.    -   For PUSCH repetition Type B, the PUSCH mapping type is set to        Type B.        The UE shall consider the S and L combinations defined in table        6.1.2.1-1 as valid PUSCH allocations

TABLE 6.1.2.1-1 Valid S and L combinations PUSCH mapping Normal cyclicprefix Extended cyclic prefix type S L S + L S L S + L Type A 0 {4, . .. , {4, . . . , 0 {4, . . . , {4, . . . , (repetition 14} 14} 12} 12}Type A only) Type B {0, . . . , {1, . . . , {1, . . . , {0, . . . , {1,. . . , {1, . . . , 13} 14} 14} for 11} 12} 12} for repetitionrepetition Type A, Type A, {1, . . . , {1, . . . , 27} for 23} forrepetition repetition Type Type B BFor PUSCH repetition Type A, when transmitting PUSCH scheduled by DCIformat 0_1 or 0_2 in PDCCH with CRC scrambled with C-RNTI, MCS-C-RNTI,or CS-RNTI with NDI=1, the number of repetitions K is determined as

-   -   if numberOfRepetitions-r16 is present in the resource allocation        table, the number of repetitions K is equal to        numberOfRepetitions-r16;    -   elseif the UE is configured with pusch-AggregationFactor, the        number of repetitions K is equal to pusch-AggregationFactor;    -   otherwise K=1.        For PUSCH repetition Type A, in case K>1, the same symbol        allocation is applied across the K consecutive slots and the        PUSCH is limited to a single transmission layer. The UE shall        repeat the TB across the K consecutive slots applying the same        symbol allocation in each slot. The redundancy version to be        applied on the nth transmission occasion of the TB, where n=0,        1, . . . K−1, is determined according to table 6.1.2.1-2.

TABLE 6.1.2.1-2 Redundancy version for PUSCH transmission rv_(id)indicated rv_(id) to be applied to n^(th) transmission by the occasion(repetition Type A) or n^(th) DCI actual repetition (repetition Type B)scheduling n mod n mod n mod n mod the PUSCH 4 = 0 4 = 1 4 = 2 4 = 3 0 02 3 1 2 2 3 1 0 3 3 1 0 2 1 1 0 2 3For PUSCH repetition Type A, a PUSCH transmission in a slot of amulti-slot PUSCH transmission is omitted according to the conditions inClause 9, Clause 11.1 and Clause 11.2A of [6, TS38.213].. . . If pusch-TimeDomainAllocationList in pusch-Config contains rowindicating resource allocation for two to eight contiguous PUSCHs, K₂indicates the slot where UE shall transmit the first PUSCH of themultiple PUSCHs. Each PUSCH has a separate SLIV and mapping type. Thenumber of scheduled PUSCHs is signalled by the number of indicated validSLIVs in the row of the pusch-TimeDomainAllocationList signalled in DCIformat 0_1.. . . .

6.1.2.1.1 Determination of the Resource Allocation Table to be Used forPUSCH

Table 6.1.2.1.1-1, Table 6.1.2.1.1-1A and Table 6.1.2.1.1-1B definewhich PUSCH time domain resource allocation configuration to apply.Table 6.1.2.1.1-4 defines the subcarrier spacing specific values j. j isused in determination of K₂ in conjunction to table 6.1.2.1.1-2, fornormal CP or table 6.1.2.1.1.-3 for extended CP, where μ_(PUSCH) is thesubcarrier spacing configurations for PUSCH.Table 6.1.2.1.1-5 defines the additional subcarrier spacing specificslot delay value for the first transmission of PUSCH scheduled by theRAR or by the fallback RAR. When the UE transmits a PUSCH scheduled byRAR or by the fallback RAR, the Δ value specific to the PUSCH subcarrierspacing μ_(PUSCH) is applied in addition to the K₂ value.

TABLE 6.1.2.1.1-1A Applicable PUSCH time domain resource allocation forDCI format 0_1 in UE specific search space scrambled with C-RNTI,MCS-C-RNTI, CS-RNTI or SP-CSI-RNTI pusch-Config pusch-Config PUSCH timepusch-ConfigCommon includes pusch- pusch-Config includes pusch- includespusch- domain resource includes pusch- TimeDo-TimeDomainAllocationListForDCI- TimeDomainAllocationList- allocation toTimeDomainAllocationList mainAllocationList Format0-1-r16 ForMultiPUSCHapply No No No No Default A Yes No No No pusch- TimeDomainAllocationListprovided in pusch- ConfigCommon No/Yes Yes No No pusch-TimeDomainAllocationList provided in pusch-Config No/Yes No/Yes Yes —pusch- TimeDomainAllocationListForDCI- Format0-1-r16 provided inpusch-Config No/Yes No/Yes — Yes pusch- TimeDomainAllocationList-ForMultiPUSCH provided in pusch-Config

TABLE 6.1.2.1.1-1B Applicable PUSCH time domain resource allocation forDCI format 0_2 in UE specific search space scrambled with C-RNTI,MCS-C-RNTI, CS-RNTI or SP-CSI-RNTI pusch-Config includespusch-ConfigCommon pusch-Config pusch- PUSCH time domain includes pusch-includes pusch- TimeDomainAllocation- resource allocationTimeDomainAllocationList TimeDomainAllocationListListForDCI-Format0-2-r16 to apply No No No Default A Yes No No pusch-TimeDomainAllocation- List provided in pusch- ConfigCommon No/Yes Yes Nopusch- TimeDomainAllocation- List provided in pusch- Config No/YesNo/Yes Yes pusch- TimeDomainAllocation- ListForDCI-Format0-2- r16provided in pusch-Config

Information elements and/or fields are discussed in 3GPP TS 38.331V16.2.0, one or more parts of which are quoted below:

BWP-Uplink

The IE BWP-Uplink is used to configure an additional uplink bandwidthpart (not for the initial BWP).

BWP-Uplink Information Element

-- ASN1START -- TAG-BWP-UPLINK-START BWP-Uplink ::= SEQUENCE {  bwp-Id BWP-Id,  bwp-Common  BWP-UplinkCommon OPTIONAL, -- Cond SetupOtherBWP bwp-Dedicated  BWP-UplinkDedicated OPTIONAL, -- Cond SetupOtherBWP  . .. } -- TAG-BWP-UPLINK-STOP -- ASN1STOP

BWP-UplinkCommon

The IE BWP-UplinkCommon is used to configure the common parameters of anuplink BWP. They are “cell specific” and the network ensures thenecessary alignment with corresponding parameters of other UEs. Thecommon parameters of the initial bandwidth part of the PCell are alsoprovided via system information. For all other serving cells, thenetwork provides the common parameters via dedicated signalling.

BWP-UplinkCommon Information Element

-- ASN1START -- TAG-BWP-UPLINKCOMMON-START BWP-UplinkCommon ::= SEQUENCE{  genericParameters  BWP,  pusch-ConfigCommon  SetupRelease { PUSCH-ConfigCommon }   OPTIONAL, -- Need M  pucch-ConfigCommon  SetupRelease {PUCCH- ConfigCommon }   OPTIONAL, -- Need M  . . . ,  [[ useInterlacePUCCH-PUSCH-r16  ENUMERATED {enabled} OPTIONAL, -- Need R ]] } -- TAG-BWP-UPLINKCOMMON-STOP -- ASN1STOP

BWP-UplinkCommon field descriptions pucch-ConfigCommon Cell specificparameters for the PUCCH of this BWP. pusch-ConfigCommon Cell specificparameters for the PUSCH of this BWP. useInterlacePUCCH-PUSCH If thefield is present, the UE uses uplink frequency domain resourceallocation Type 2 for cell-specific PUSCH, e.g., PUSCH scheduled by RARUL grant (see 38.213 clause 8.3 and 38.214 clause 6.1.2.2) and usesinterlaced PUCCH Format 0 and 1 for cell-specific PUCCH (see TS 38.213[13], clause 9.2.1).

BWP-UplinkDedicated

The IE BWP-UplinkDedicated is used to configure the dedicated (UEspecific) parameters of an uplink BWP.

BWP-UplinkDedicated Information Element

-- ASN1START -- TAG-BWP-UPLINKDEDICATED-START BWP-UplinkDedicated ::=SEQUENCE {  pucch-Config  SetupRelease { PUCCH-Config } OPTIONAL, --Need M  pusch-Config  SetupRelease { PUSCH-Config } OPTIONAL, -- Need M configuredGrantConfig  SetupRelease { ConfiguredGrantConfig }  OPTIONAL, - - Need M  srs-Config  SetupRelease { SRS-Config }OPTIONAL, -- Need M  . . . ,  [[  cp-ExtensionC2-r16  INTEGER (1..28)OPTIONAL, -- Need R  cp-ExtensionC3-r16  INTEGER (1..28) OPTIONAL, --Need R  useInterlacePUCCH-PUSCH-r16  ENUMERATED {enabled} OPTIONAL, --Need R  pucch-ConfigurationList-r16  SetupRelease { PUCCH-ConfigurationList-r16 }   OPTIONAL, -- Need M --TAG-BWP-UPLINKDEDICATED-STOP -- ASN1STOP

PUSCH-Config

The IE PUSCH-Config is used to configure the UE specific PUSCHparameters applicable to a particular BWP.

PUSCH-Config Information Element

-- ASN1START -- TAG-PUSCH-CONFIG-START PUSCH-Config ::= SEQUENCE {  ... resourceAllocation  ENUMERATED { resourceAllocationType0,resourceAllocationType1, dynamicSwitch},  pusch-TimeDomainAllocationList SetupRelease { PUSCH- TimeDomainResourceAllocationList }   OPTIONAL, --Need M  pusch-AggregationFactor  ENUMERATED { n2, n4, n8 } OPTIONAL, --Need S  ...  resourceAllocationDCI-0-2-r16    ENUMERATED {resourceAllocationType0, resourceAllocationType1, dynamicSwitch}OPTIONAL, -- Need M  ...  pusch-TimeDomainAllocationListDCI-0-2-r16SetupRelease { PUSCH-TimeDomainResourceAllocationList-r16 } OPTIONAL, --Need M  -- End of the parameters for DCI format 0_2 introduced inV16.1.0  -- Start of the parameters for DCI format 0_1 introduced inV16.1.0  pusch-TimeDomainAllocationListDCI-0-1-r16 SetupRelease {PUSCH-TimeDomainResourceAllocationList-r16 } OPTIONAL, -- Need M  ... pusch-TimeDomainAllocationListForMultiPUSCH-r16 SetupRelease {PUSCH-TimeDomainResourceAllocationList-r16 } OPTIONAL, -- Need M  ... --TAG-PUSCH-CONFIG-STOP -- ASN1STOP

PUSCH-Config field descriptions . . . pusch-AggregationFactor Number ofrepetitions for data (see TS 38.214 [19], clause 6.1.2.1). If the fieldis absent the UE applies the value 1. . . .pusch-TimeDomainAllocationList List of time domain allocations fortiming of UL assignment to UL data (see TS 38.214 [19], table6.1.2.1.1-1). The field pusch-TimeDomainAllocationList applies to DCIformats 0_0 or DCI format 0_1 when the fieldpusch-TimeDomainAllocationListDCI-0-1 is not configured (see TS 38.214[19], table 6.1.2.1.1-1 and table 6.1.2.1.1-1A). The network does notconfigure the pusch-TimeDomainAllocation (without suffix) simultaneouslywith the pusch- TimeDomainAllocation-r16.pusch-TimeDomainAllocationListDCI-0-1 Configuration of the time domainresource allocation (TDRA) table for DCI format 0_1 (see TS 38.214 [19],clause 6.1, table 6.1.2.1.1-1A). pusch-TimeDomainAllocationListDCI-0-2Configuration of the time domain resource allocation (TDRA) table forDCI format 0_2 (see TS 38.214 [19], clause 6.1.2, table 6.1.2.1.1-1B).pusch-TimeDomainAllocationListForMultiPUSCH Configuration of the timedomain resource allocation (TDRA) table for multiple PUSCH (see TS38.214 [19], clause 6.1.2). The network configures at most 16 rows inthis TDRA table in PUSCH-TimeDomainResourceAllocationList-r16 configuredby this field. . . . resourceAllocation, resourceAllocationDCI-0-2Configuration of resource allocation type 0 and resource allocation type1 for non-fallback DCI (see TS 38.214 [19], clause 6.1.2). The fieldresourceAllocation applies to DCI format 0_1 and the fieldresourceAllocationDCI-0-2 applies to DCI format 0_2 (see TS 38.214 [19],clause 6.1.2). resourceAllocationType1GranularityDCI-0-2 Configures thescheduling granularity applicable for both the starting point and lengthindication for resource allocation type 1 in DCI format 0_2. If thisfield is absent, the granularity is 1 PRB (see TS 38.214 [19], clause6.1.2.2.2).

PUSCH-TimeDomainResourceAllocationList

The IE PUSCH-TimeDomainResourceAllocation is used to configure a timedomain relation between PDCCH and PUSCH.PUSCH-TimeDomainResourceAllocationList contains one or more of suchPUSCH-TimeDomainResourceAllocations. The network indicates in the ULgrant which of the configured time domain allocations the UE shall applyfor that UL grant. The UE determines the bit width of the DCI fieldbased on the number of entries in thePUSCH-TimeDomainResourceAllocationList. Value 0 in the DCI field refersto the first element in this list, value 1 in the DCI field refers tothe second element in this list, and so on.

PUSCH-TimeDomainResourceAllocation Information Element

-- ASN1START -- TAG-PUSCH-TIMEDOMAINRESOURCEALLOCATIONLIST-STARTPUSCH-TimeDomainResourceAllocationList ::= SEQUENCE(SIZE(1..maxNrofUL-Allocations)) OF PUSCH-TimeDomainResourceAllocationPUSCH-TimeDomainResourceAllocation ::= SEQUENCE {   k2 INTEGER(0..32)OPTIONAL, -- Need S   mappingType ENUMERATED {typeA, typeB},  startSymbolAndLength INTEGER (0..127) }PUSCH-TimeDomainResourceAllocationList-r16 ::= SEQUENCE(SIZE(1..maxNrofUL-Allocations-r16)) OF PUSCH-TimeDomainResourceAllocation-r16 PUSCH-TimeDomainResourceAllocation-r16::= SEQUENCE {   k2-r16   INTEGER(0..32) OPTIONAL, -- Need S  puschAllocationList-r16   SEQUENCE(SIZE(1..maxNrofMultiplePUSCHs-r16)) OF PUSCH-Allocation-r16,  . . . }PUSCH-Allocation-r16 ::= SEQUENCE {   mappingType-r16  ENUMERATED{typeA, typeB} OPTIONAL, -- Cond NotFormat01-02-Or-TypeA  startSymbolAndLength-r16  INTEGER (0..127) OPTIONAL, -- CondNotFormat01-02-0r-TypeA   startSymbol-r16  INTEGER (0..13) OPTIONAL, --Cond RepTypeB   length-r16  INTEGER (1..14) OPTIONAL, -- Cond RepTypeB  numberOfRepetitions-r16  ENUMERATED {n1, n2, n3, n4, n7, n8, n12, n16}OPTIONAL, -- Cond Format01-02   . . . } --TAG-PUSCH-TIMEDOMAINRESOURCEALLOCATIONLIST-STOP -- ASN1STOP

PUSCH-TimeDomainResourceAllocationList field descriptions k2 Correspondsto L1 parameter ′K2′ (see TS 38.214 [19], clause 6.1.2.1) When the fieldis absent the UE applies the value 1 when PUSCH SCS is 15/30 kHz; thevalue 2 when PUSCH SCS is 60 kHz, and the value 3 when PUSCH SCS is120KHz. length Indicates the length allocated for PUSCH for DCI format0_1/0_2 (see TS 38.214 [19], clause 6.1.2.1). mappingType Mapping type(see TS 38.214 [19], clause 6.1.2.1). numberOfRepetitions Number ofrepetitions for DCI format 0_1/0_2 (see TS 38.214 [19], clause 6.1.2.1).puschAllocationList One or multiple PUSCH continuous in time domainwhich share a common k2 (see TS 38.214 [19], clause 6.1.2.1). This listonly has one element in pusch-TimeDomainAllocationListDCI-0- 1-r16 andin pusch-TimeDomainAllocationListDCI-0-2-r16. startsymbol Indicates theindex of start symbol for PUSCH for DCI format 0_1/0_2 (see TS 38.214[19], clause 6.1.2.1). startSymbolAndLength An index giving validcombinations of start symbol and length (jointly encoded) as start andlength indicator (SLIV). The network configures the field so that theallocation does not cross the slot boundary. (see TS 38.214 [19], clause6.1.2.1).

Conditional Presence Explanation Format01-02 Inpusch-TimeDomainAllocationListForMultiPUSCH-r16, the field is absent. Inpusch-TimeDomainAllocationListDCI-0-1 and in pusch-TimeDomainAllocationListDCI-0-2, the field is mandatory present.NotFormat01-02-Or- In pusch-TimeDomainAllocationListForMultiPUSCH-r16,the field TypeA is mandatory present. Inpusch-TimeDomainAllocationListDCI-0-1, the field is optionally presentif pusch-RepTypeIndicatorDCI-0-1 is set to pusch- RepTypeA, Need R. Itis absent otherwise, Need R. In pusch-TimeDomainAllocationListDCI-0-2,the field is optionally present if pusch-RepTypeIndicatorDCI-0-2 is setto pusch- RepTypeA, Need R. It is absent otherwise, Need R. RepTypeB Inpusch-TimeDomainAllocationListForMultiPUSCH-r16, the field is absent. Inpusch-TimeDomainAllocationListDCI-0-1, the field is optionally presentif pusch-RepTypeIndicatorDCI-0-1 is set to pusch- RepTypeB, Need R. Itis absent otherwise, Need R. In pusch-TimeDomainAllocationListDCI-0-2,the field is optionally present if pusch-RepTypeIndicatorDCI-0-2 is setto pusch- RepTypeB, Need R. It is absent otherwise, Need R.

Channel access procedure is discussed in 3GPP TS 37.213 V16.3.0, one ormore parts of which are quoted below:

4 Channel Access Procedure 4.0 General

Unless otherwise noted, the definitions below are applicable for thefollowing terminologies used in this specification:

-   -   A channel refers to a carrier or a part of a carrier consisting        of a contiguous set of resource blocks (RBs) on which a channel        access procedure is performed in shared spectrum.    -   A channel access procedure is a procedure based on sensing that        evaluates the availability of a channel for performing        transmissions. The basic unit for sensing is a sensing slot with        a duration T_(sl)=9 us. The sensing slot duration T_(sl) is        considered to be idle if an eNB/gNB or a UE senses the channel        during the sensing slot duration, and determines that the        detected power for at least 4 us within the sensing slot        duration is less than energy detection threshold X_(Thresh).        Otherwise, the sensing slot duration T_(sl) is considered to be        busy.    -   A channel occupancy refers to transmission(s) on channel(s) by        eNB/gNB/UE(s) after performing the corresponding channel access        procedures in this clause.    -   A Channel Occupancy Time refers to the total time for which        eNB/gNB/UE and any eNB/gNB/UE(s) sharing the channel occupancy        perform transmission(s) on a channel after an eNB/gNB/UE        performs the corresponding channel access procedures described        in this clause. For determining a Channel Occupancy Time, if a        transmission gap is less than or equal to 25 us, the gap        duration is counted in the channel occupancy time. A channel        occupancy time can be shared for transmission between an eNB/gNB        and the corresponding UE(s).    -   A UL transmission burst is defined as a set of transmissions        from a UE without any gaps greater than 16 us. Transmissions        from a UE separated by a gap of more than 16 us are considered        as separate UL transmission bursts. A UE can transmit        transmission(s) after a gap within a UL transmission burst        without sensing the corresponding channel(s) for availability.

One, some and/or all of the following terminology and assumptions may beused hereafter.

-   -   Base station (BS): a network central unit and/or a network node        in New Radio (NR) which is used to control one or more        transmission and reception points (TRPs) which are associated        with one or more cells. Communication between a base station and        one or more TRPs may be via fronthaul. Base station may be        referred to as central unit (CU), eNB, gNB, and/or NodeB.    -   Cell: a cell comprises one or more associated TRPs (e.g.,        coverage of the cell may comprise coverage of some and/or all        associated TRP(s)). One cell may be controlled by one base        station. Cell may be referred to as TRP group (TRPG).    -   Uplink-control signal (UL-control signal): An UL-control signal        may comprise at least one of a scheduling request (SR), channel        state information (CSI), Hybrid Automatic Repeat Request        (HARQ)-Acknowledgment (ACK)/Negative Acknowledgment (NACK) for a        downlink (DL) transmission.    -   Slot: A slot is a scheduling unit in NR. A slot duration (e.g.,        a duration of a slot) may be 14 orthogonal frequency-division        multiplexing (OFDM) symbols.

For operation with shared spectrum channel access in a serving cell, aUE may need to perform channel access and/or a Listen Before Talk (LBT)procedure before performing an uplink (UL) transmission (e.g., the UEmay be required to perform the channel access and/or the LBT procedurein order to perform the uplink transmission). In order to reduce LBTattempts and/or channel access attempts (and/or in order to reducecontrol signaling overhead), a single Downlink Control Information (DCI)may schedule multi-PUSCHs. For example, multi-PUSCHs functionality forthe single DCI scheduling the multi-PUSCHs may be introduced in order toreduce LBT attempts and/or channel access attempts (and/or in order toreduce control signaling overhead). In some examples, the multi-PUSCHsscheduled by the single DCI may comprise multiple PUSCHs scheduled bythe single DCI. The single DCI may schedule the multi-PUSCHscontinuously. For example, the multi-PUSCHs may be scheduled overconsecutive (e.g., contiguous) time units and/or slots. In someexamples, when multi-PUSCHs functionality is implemented (such thatmulti-PUSCHs can be scheduled by the single DCI, for example), a network(e.g., a gNB) does not need to perform channel access and/or LBT (forDCI transmission, for example) every time that the network schedules aPhysical Uplink Shared Channel (PUSCH) (since the network may transmitthe single DCI to schedule the multi-PUSCHs, wherein the network may notbe required to transmit a separate DCI for each PUSCH of themulti-PUSCHs, for example). PUSCHs of the scheduled multi-PUSCHs may beused for transmitting Transport Blocks (TBs), Medium Access Control(MAC) Protocol Data Units (PDUs), and/or data traffic. For example,different PUSCHs of the scheduled multi-PUSCHs may be used fortransmitting different TBs, different MAC PDUs, and/or different datatraffic (e.g., a first PUSCH of the scheduled multi-PUSCHs may be usedfor transmitting a first TB, a first MAC PDU and/or first data traffic,and/or the second PUSCH of the scheduled multi-PUSCHs may be used fortransmitting a second TB, a second MAC PDU and/or second data traffic,wherein the second TB, the second MAC PDU and/or the second data trafficare different from the first TB, the first MAC PDU and/or the first datatraffic). Different PUSCHs of the scheduled multi-PUSCHs may beassociated with different HARQ process numbers/IDs (e.g., a first PUSCHof the scheduled multi-PUSCHs may be associated with a first HARQprocess number/ID and/or a second PUSCH of the scheduled multi-PUSCHsmay be associated with a second HARQ process number/ID, wherein thesecond HARQ process number/ID may be different from the first HARQprocess number/ID). As used herein, “HARQ process number/ID” may referto a HARQ process number of a HARQ process (e.g., a number thatidentifies the HARQ process) and/or a HARQ process identification (ID)of the HARQ process. A HARQ process ID may be an example of a HARQprocess number. As used herein, “multi-PUSCHs functionality” may referto functionality of scheduling multiple PUSCHs using a single DCI (toreduce LBT attempts, channel access attempts and/or control signalingoverhead, for example), wherein the multiple PUSCHs are used fortransmitting at least one of different TBs, different MAC PDUs,different sets of data traffic, etc.

In Rel-16 (e.g., 3GPP release 16), a UE may be configured with a timedomain allocation list (e.g.,PUSCH-TimeDomainResourceAllocationList-r16). Each entry in the timedomain allocation list may indicate a slot offset (e.g., one slotoffset) and one or more time resource allocation configurations (e.g., atime resource allocation configuration of the one or more time resourceallocation configurations may be a PUSCH-Allocation-r16). A number oftime resource allocation configurations of the one or more time resourceallocation configurations may indicate a number of PUSCHs (e.g., anumber of scheduled PUSCHs for different TBs) that are scheduled by aDCI. A code-point of a time-related field in a DCI corresponds to anentry in the time domain allocation list (e.g., one code-point of onetime-related field in the DCI corresponds to one entry in the timedomain allocation list). The UE may be configured withpusch-TimeDomainAllocationListForMultiPUSCH-r16 such that an entry inthe time domain allocation list indicates one or more Start and LengthIndicator Values (SLIVs). Each SLIV of the one or more SLIVs mayindicate a starting OFDM symbol and a number of consecutive OFDM symbolsfrom the starting OFDM symbol (e.g., the number of consecutive OFDMsymbols may correspond to a length including the starting OFDM symbol).

An association of SLIV, starting OFDM symbol and length (e.g., length ofconsecutive OFDM symbols) is illustrated in FIG. 5. For example, SLIV=28may mean and/or imply time resource allocation {#0˜#2}. For example, asshown in FIG. 5, SLIV=28 corresponds to a starting OFDM symbol of 0 anda length of 3. The length may be a length of consecutive OFDM symbols(e.g., the length may correspond to a number of OFDM symbols of the OFDMsymbols associated with the resource allocation, wherein the startingOFDM symbol is included in the length). Thus, based on the starting OFDMsymbol of 0 and the length of 3, the time resource allocation (indicatedby SLIV=28) may correspond to OFDM symbols {#0˜#2}. Accordingly, in anexample in which a transmission is performed in a slot based on SLIV=28,the transmission may be performed within the OFDM symbols {#0˜#2}.

FIG. 6 illustrates a list 600 for resource allocation for PUSCH. A UEmay be configured with the list 600. In some examples, each entry in thelist (e.g., each row shown in FIG. 6) indicates a slot offset (k2) and aPUSCH-allocation. In some examples, the slot offset (k2) is between aslot of a scheduling Physical Downlink Control Channel (PDCCH) and aslot of a scheduled PUSCH (e.g., an initial scheduled PUSCH). Forexample, the slot offset (k2) may be a slot offset between the slot ofthe scheduling PDCCH and the slot of the scheduled PUSCH, wherein thescheduled PUSCH may be an initial PUSCH transmission of one or morePUSCH transmissions scheduled by the scheduling PDCCH. In some examples,a PUSCH-allocation may comprise one or more sets of resource allocationinformation, wherein each set of resource allocation information of theone or more sets of resource allocation information comprises anindication of a PUSCH mapping type and a SLIV. In FIG. 6, each set ofresource allocation information is within a set of braces (e.g., “{PUSCHmapping type, SLIV}”). In this example, entry 5 includes four sets ofresource allocation information, wherein each set of resource allocationinformation comprises an indication of a PUSCH mapping type and a SLIV(e.g., a first set of resource allocation information of entry 5comprises an indication of a first PUSCH mapping type “type-A” and afirst SLIV “70”, a second set of resource allocation information ofentry 5 comprises an indication of a second PUSCH mapping type “type-A”and a second SLIV “71”, etc.).

FIG. 7 illustrates an example scenario associated with implementation ofmulti-PUSCHs functionality. In the example scenario of FIG. 7, the UEreceives a DCI in slot n. A time domain resource allocation (TDRA) fieldin the DCI may be indicative of entry 5 of the list 600 of FIG. 6 (e.g.,the UE is configured with the list 600). The UE may transmit PUSCH1(e.g., an initial PUSCH of multiple PUSCHs scheduled by the DCI) in slotn+k2 (e.g., the slot n+k2 is slot n+2 since entry 5 of the list 600indicates that k2=2), PUSCH2 (e.g., a second PUSCH, of the multiplePUSCHs, following the initial PUSCH) in slot n+k2+1, PUSCH3 (e.g., athird PUSCH, of the multiple PUSCHs, following the second PUSCH) in slotn+k2+2, and/or PUSCH4 (e.g., a fourth PUSCH, of the multiple PUSCHs,following the third PUSCH) in slot n+k2+3. Different PUSCHs may comprisedifferent TBs associated with different HARQ process numbers. In anexample shown in FIG. 7, the DCI may be indicative of HARQ processnumber 3. Based on the DCI being indicative of HARQ process number 3,HARQ process numbers for PUSCH1˜4 may be {3, 4, 5, 6} (e.g., PUSCH 1 maybe associated with HARQ process number 3, PUSCH 2 may be associated withHARQ process number 4, etc.). For example, a HARQ process numberindicated by the DCI (e.g., HARQ process number 3) is associated with(e.g., applied to) an initial scheduled PUSCH (e.g., PUSCH1) of themultiple PUSCHs (scheduled by the DCI, for example). HARQ processes forremaining PUSCHs (e.g., PUSCH2˜4) of the multiple PUSCHs (other than theinitial PUSCH transmission) are based on the indicated HARQ processnumber 3. For example, for each PUSCH of the remaining PUSCHs, apreceding HARQ process number of a preceding PUSCH may be increased(e.g., incremented by 1) to determine a HARQ process numbercorresponding to the PUSCH. In an example, the HARQ process numbercorresponding to the PUSCH may be determined by performing a modulooperation in association with increasing the preceding HARQ processnumber of the preceding PUSCH to determine the HARQ process numbercorresponding to the PUSCH. For example, the HARQ process numbercorresponding to the PUSCH may be equal to (the preceding HARQ processnumber+1) modulo a number of HARQ process numbers. The number of HARQprocess numbers may be 16. The number of HARQ process numbers maycorrespond to a number of HARQ process numbers (e.g., a total number ofHARQ process numbers) supported and/or used by the UE and/or a number ofHARQ process numbers (e.g., a total number of HARQ process numbers) thatthe UE is configured with (e.g., a number of HARQ process numbers thatthe UE can process, and/or a number of HARQ process numbers that the UEcan simultaneously process).

In some examples, the list 600 of FIG. 6 may be used for PhysicalDownlink Shared Channel (PDSCH), wherein k2 can be replaced by k0, andPUSCH-allocation can be replaced by PDSCH-allocation. In an example, k0is indicative of a slot offset between a slot of a scheduling PDCCH anda slot of a scheduled PDSCH (e.g., an initial scheduled PDSCH). Forexample, k0 may be a slot offset between the slot of the schedulingPDCCH and the slot of the scheduled PDSCH, wherein the scheduled PDSCHmay be an initial PDSCH transmission of one or more PDSCH transmissionsscheduled by the scheduling PDCCH. In an example in which the list 600is used for PDSCH, PUSCH mapping type of the table 600 may be replacedby PDSCH mapping type. A design similar to a design for PUSCH can alsoapplied in PDSCH. One or more of the techniques provided herein withrespect to PUSCH may be applied in PDSCH.

In some examples, in order to improve (e.g., guarantee) PUSCHtransmission reliability, PUSCH aggregation/repetition functionality maybe implemented to apply slot aggregation of PUSCH and/or repetition ofPUSCH for a single TB. As used herein, “PUSCH aggregation/repetitionfunctionality” may refer to functionality of applying aggregation ofPUSCH and/or repetition of PUSCH for a single TB (to improve PUSCHtransmission reliability, for example). A UE may be configured withpusch-AggregationFactor for semi-statically repeating a PUSCHtransmission for a single TB. For example, a scheduling unit for asingle TB may be a number of consecutive slots indicated bypusch-AggregationFactor. An example scenario associated with PUSCHaggregation/repetition functionality is shown in FIG. 8. In the examplescenario of FIG. 8, assuming UE is configured withpusch-AggregationFactor=2, in response to (e.g., upon) the UE receivinga DCI in slot n (wherein the DCI indicates resource allocation {#0˜#10}for slot n+k2), the UE may consider the same resource allocation{#0˜#10} that is allocated for the slot n+k2 to be allocated for aconsecutive slot following the slot n+k2 (e.g., the consecutive slot isslot n+k2+1) according to pusch-AggregationFactor=2. The UE may beconfigured with another list (e.g., a second list, such as a list ofPUSCH resource allocations) other than the list 600, wherein each entryin the second list indicates a resource allocation of PUSCH and arepetition number for PUSCH. The UE may receive a DCI indicating anentry from the second list to dynamically change the repetition numberbased on which entry is indicated. In an example, if an entry indicatedby the DCI is indicative of a repetition number of 2, the UE may performa scheduled PUSCH transmission with two repetitions (such as shown inthe example scenario of FIG. 8, where TB1 is transmitted two times). Forexample, the repetition number may be based on (e.g., equal to) theaggregation factor, wherein the repetition number (and/or theaggregation factor) may correspond to a number of times the UE transmitsthe same data (e.g., the same TB).

However, in order to have the benefits of overhead reduction (e.g.,reducing LBT attempts and/or channel access attempts) and the benefitsof improved reliability (e.g., improved PUSCH transmission reliability)associated with repetition and/or aggregation, a single DCI schedulingmulti-PUSCHs with dynamically and/or semi-statically indicatingrepetition number and/or slot aggregation number (and/or aggregationfactor) needs further considerations.

An original portion of Section 6.1.2.1 of 3GPP TS 38.214 V16.3.0 isquoted below:

For PUSCH repetition Type A, when transmitting PUSCH scheduled by DCIformat 0_1 or 0_2 in PDCCH with CRC scrambled with C-RNTI, MCS-C-RNTI,or CS-RNTI with NDI=1, the number of repetitions K is determined as

 - if numberOfRepetitions-r16 is present in the resource allocationtable, the number of  repetitions K is equal to numberOfRepetitions-r16; - elseif the UE is configured with pusch-AggregationFactor, the numberof repetitions  K is  equal to pusch-AggregationFactor;  - otherwiseK=1. ...If pusch-TimeDomainAllocationList in pusch-Config contains rowindicating resource allocation for two to eight contiguous PUSCHs, K₂indicates the slot where UE shall transmit the first PUSCH of themultiple PUSCHs. Each PUSCH has a separate SLIV and mapping type. Thenumber of scheduled PUSCHs is signalled by the number of indicated validSLIVs in the row of the pusch-TimeDomainAllocationList signalled in DCIformat 0_1.

The UE may not be able to interpret and/or implement (and/or may beconfused how to interpret and/or implement) the above quoted portion ofSection 6.1.2.1 of 3GPP TS 38.214 V16.3.0.

For example, once the UE is using numberOfRepetitions-r16 orpusch-AggregationFactor (e.g., a pusch-AggregationFactor that is largerthan 1), the UE may not be able to determine (and/or may be confused of)resource allocation for slot n+k2+1. The UE may not be able to determine(and/or may be confused of) resource allocation for slot n+k2+1 since,from a repetition point of view (e.g., implementation of PUSCHaggregation/repetition functionality), slotsn+k2+1˜n+k2+pusch-AggregationFactor−1 may be one or more repeated slotsfor slot n+k2 while from a multi-PUSCH point of view (e.g.,implementation of multi-PUSCHs functionality), slots n+k2+1˜n+k2+#SLIV−1may be used for other transmissions that are not repetitions of thePUSCH transmission of slot n+k2. In other words, for implementation ofPUSCH aggregation/repetition functionality, each slot of one, someand/or all slots of slots n+k2+1˜n+k2+pusch-AggregationFactor−1 may havethe same and/or similar resource allocation as slot n+k2, the sameand/or similar mapping type as slot n+k2 and/or may have transmission ofthe same TB as slot n+k2, whereas for implementation of multi-PUSCHsfunctionality, each slot of one, some and/or all slots of slotsn+k2+1˜n+k2+#SLIV−1 may have resource allocation different from slotn+k2, mapping type different from slot n+k2 and/or transmission of a TBdifferent from a TB transmitted in slot n+k2. Thus, how the UE considersand/or uses the scheduled resource allocation with repetition numberand/or slot aggregation may need further considerations. Alternativelyand/or additionally, the scheduled resource allocation may be scheduledby a dynamic grant.

Techniques of the present disclosure may be used in, but are not limitedto being used in, unlicensed spectrum and/or in operation in sharedspectrum channel access. Techniques of the present disclosure may beapplied on licensed spectrum.

A first concept of the present disclosure is that, for a DCI schedulingmulti-TB transmission and/or reception with TB repetition (e.g., same TBrepetition), a pattern may be used for determining an associationbetween a TB and a slot, and/or an association between a HARQ processnumber and a slot.

A second number may be configured and/or indicated by a network. Forexample, the UE may be configured with the second number (e.g., thenetwork may transmit an indication, of the second number, to the UE).The second number may be a repetition factor and/or an aggregationfactor (e.g., the repetition factor and/or the aggregation factor may beset to the second number).

The DCI may schedule and/or indicate a first number. The first number isa first number of TBs, a first number of HARQ process numbers, a firstnumber of slots and/or a first number of SLIVs.

The DCI indicates a first HARQ process number (e.g., a specific HARQprocess number). The first HARQ process number is applied on an initialscheduled slot scheduled by the DCI (e.g., the first HARQ process numberis applied on an initial scheduled slot of one or more scheduled slotsscheduled by the DCI).

The DCI may be DCI format 0_1, DCI format 0_2, DCI format 1_1, or DCIformat 1_2.

In an example, the pattern corresponds to: (i) performing a first set oftransmissions over a first set of slots, wherein a number oftransmissions of the first set of transmissions and a number of slots ofthe first set of consecutive slots are equal to the first number ofSLIVs, wherein HARQ process numbers associated with the first set oftransmissions are increased (e.g., incremented by 1) for eachtransmission of the first set of transmissions, and/or (ii) performingone or more sets of transmissions over one or more sets of slots until aquantity of sets of transmissions, comprising the first set oftransmissions and the one or more sets of transmissions, meets thesecond number corresponding to the aggregation factor, wherein the oneor more sets of transmissions correspond to one or more repetitions ofthe first set of transmissions. In some examples, the HARQ processnumbers are increased for each transmission of a set of transmissionswith a modulo operation of a third number. The third number may be 16.The third number may correspond to a number of HARQ process numbers,such as a number of HARQ process numbers supported and/or used by the UEand/or a number of HARQ process numbers that the UE is configured with(e.g., a number of HARQ process numbers that the UE can process, and/ora number of HARQ process numbers that the UE can simultaneouslyprocess).

In an example in which the first number of SLIVs is 4 and the secondnumber corresponding to the aggregation factor is 2, the pattern maycorrespond to: (i) performing a first set of transmissions over a firstset of slots, wherein the first set of transmissions comprises 4transmissions comprising: an initial transmission associated with thefirst HARQ process number (e.g., FIRSTHARQPROCESS), a secondtransmission, following the initial transmission, associated with asecond HARQ process number (e.g., FIRSTHARQPROCESS+1), a thirdtransmission, following the second transmission, associated with a thirdHARQ process number (e.g., FIRSTHARQPROCESS+2), and a fourthtransmission, of the first set of transmissions, associated with afourth HARQ process number (e.g., FIRSTHARQPROCESS+3), and (ii)performing a second set of transmissions over a second set of slots,wherein the second set of transmissions corresponds to a repetition ofthe first set of transmissions and wherein the second set oftransmissions comprises 4 transmissions comprising: an initialtransmission associated with the first HARQ process number, a secondtransmission, following the initial transmission of the second set oftransmissions, associated with the second HARQ process number, a thirdtransmission, following the second transmission of the second set oftransmissions, associated with the third HARQ process number, and afourth transmission, following the third transmission of the second setof transmissions, associated with the fourth HARQ process number. In theexample, the pattern may end upon completion of the second set oftransmissions since the second number corresponding to the aggregationfactor is 2, and/or since a quantity of sets of transmissions of thefirst set of transmissions and the second set of transmissions is 2. Insome examples, slots of the first set of slots and the second set ofslots are consecutive slots (e.g., slots of the first set of slots maybe contiguous with each other, slots of the second set of slots may becontiguous with each other, and/or a last slot of the first set of slotsmay be contiguous with an initial slot of the second set of slots). Insome examples, for each transmission following an initial transmissionof the first set of transmissions and/or for each transmission followingan initial transmission of the second set of transmissions, a precedingHARQ process number associated with a preceding transmission isincreased (e.g., incremented by 1) and/or a modulo operation of thethird number is performed to determine a HARQ process number for thetransmission. In an example in which the third number is 16, the secondHARQ process number (associated with the second transmission of thefirst set of transmissions and the second transmission of the second setof transmissions) may be equal to (FIRSTHARQPROCESS+1) modulo (16).

For example, in an example in which the second number corresponding tothe aggregation factor exceeds 1, the pattern may be two or more roundsof HARQ process numbers, wherein each round of HARQ process numberscomprises a number of HARQ process numbers equal to the first number ofSLIVs, wherein HARQ process numbers of each round of HARQ processnumbers are consecutively increased (e.g., incremented by 1 and/orincreased with a modulo operation of the third number), wherein aninitial HARQ process number of each round of HARQ process numbers is thefirst HARQ process number, and/or wherein a number of rounds of the twoor more rounds of HARQ process numbers is equal to the second numbercorresponding to the aggregation factor. The pattern may be applied to aplurality of slots (e.g., a plurality of consecutive slots starting withslot n+k2). Each round of HARQ process numbers of the two or more roundsof HARQ process numbers may be applied to a set of slots of theplurality of slots. In an example in which the second numbercorresponding to the aggregation factor is 2 (and the pattern is tworounds of HARQ process numbers, for example) and the first number ofSLIVs is 4, the plurality of slots may be 8 slots (e.g., 8 consecutiveslots starting with slot n+k2, such as 8 slots that are contiguous witheach other), wherein a first set of 4 slots of the plurality of slotsmay correspond to a first round of HARQ process numbers and a second setof 4 slots of the plurality of slots may correspond to a second round ofHARQ process numbers, and/or wherein HARQ process numbers of the secondround of HARQ process numbers match HARQ process numbers of the firstround of HARQ process numbers. In an example in which the first HARQprocess number is 3, the first set of 4 slots may be associated withHARQ process numbers {3, 4, 5, 6}, respectively, and/or the second setof 4 slots may be associated with the same HARQ process numbers {3, 4,5, 6}, respectively.

The pattern may be determined based on (e.g., derived from) the firstnumber of SLIVs and the second number corresponding to the aggregationfactor.

In some examples, if the second number corresponding to the aggregationfactor is larger than the first number of SLIVs, the pattern may berepetition of the first HARQ process number until a number ofrepetitions of the first HARQ process number is equal to the firstnumber of SLIVs. For example, the pattern may correspond to performingfirst transmissions associated with the first HARQ process number overfirst slots, wherein a number of transmissions of the firsttransmissions and/or a number of slots of the first slots are equal tothe first number of SLIVs. For example, the first slots may beconsecutive slots (e.g., the first slots may be contiguous with eachother). Alternatively and/or additionally, the pattern may be applied tothe first slots by way of associating the first HARQ process number toeach slot of the first slots. For example, in an example in which thefirst number of SLIVs is 4 and the second number corresponding to theaggregation factor greater than 4, the number of transmissions of thefirst transmissions may be 4 (e.g., the first number of SLIVs) and/orthe number of slots of the first slots may be 4 (e.g., the first numberof SLIVs).

In some examples, if the second number corresponding to the aggregationfactor is smaller than or equal to the first number of SLIVs, thepattern may be one or more rounds of HARQ process numbers, wherein afirst round (e.g., an initial round) of the one or more rounds comprisesconsecutively increasing HARQ process numbers starting with the firstHARQ process number. A number of HARQ process numbers of theconsecutively increasing HARQ process numbers of the first round (and/ora number of times that HARQ process numbers are increased in the firstround) is equal to

${\frac{z}{x} - 1},$

wherein z corresponds to the first number of SLIVs and x corresponds tothe second number corresponding to the aggregation factor. In someexamples, a ceil (e.g., ceiling) operation and/or a floor operation maybe performed to determine the number of HARQ process numbers of theconsecutively increasing HARQ process numbers of the first round (and/orthe number of times that HARQ process numbers are increased in the firstround). For example, a value (e.g.,

$\left. {\frac{z}{x} - 1} \right)$

may be rounded up (e.g., rounded up, according to a ceil operation, tothe lowest integer higher than the value) or rounded down (e.g., roundeddown, according to a floor operation, to the highest integer lower thanthe value) to determine the number of HARQ process numbers of theconsecutively increasing HARQ process numbers of the first round (and/orthe number of times that HARQ process numbers are increased in the firstround). A second round (e.g., a next round after the initial round) ofthe one or more rounds may comprise consecutively increasing HARQprocess numbers starting with the first HARQ process number. A number ofHARQ process numbers of the consecutively increasing HARQ processnumbers of the second round. The number of HARQ process numbers of theconsecutively increasing HARQ process numbers of the second round may beequal to the first number of SLIVs or the number of HARQ process numbers(e.g.,

$\left. {\frac{z}{x} - 1} \right)$

of the first round. In an example, the number of HARQ process numbers ofthe second round is equal to a minimum (e.g., a lowest number) among thefirst number of SLIVs and the number of HARQ process numbers (e.g.,

$\left. {\frac{z}{x} - 1} \right)$

of the first round.

In some examples, a length of the pattern (e.g., a number of slots ofthe pattern) may be (and/or may be based on) the first number of SLIVs.

In some examples, the pattern is cyclic repetitions of HARQ processnumbers from the first HARQ process number to a last HARQ processnumber. In some examples, the last HARQ process number may be equal tothe first HARQ process number+a fourth number−1. Alternatively and/oradditionally, a modulo operation with the third number (e.g., the numberof HARQ process numbers supported and/or used by the UE and/or thenumber of HARQ process numbers that the UE is configured with) may beperformed to determine the last HARQ process number. In an example inwhich the third number is 16, the last HARQ process number may be equalto (the first HARQ process number+the fourth number−1) modulo 16. In anexample, each cyclic repetition of the cyclic repetitions may be acyclic repetition of the first HARQ process number, a second HARQprocess number corresponding to the first HARQ process number+1, . . . ,the last HARQ process number corresponding to the first HARQ processnumber+the third number−1. Alternatively and/or additionally, one ormore HARQ process numbers of the cyclic repetition (e.g., the one ormore HARQ process numbers may comprise at least one of the second HARQprocess number, . . . , the last HARQ process number) may be determinedby performing one or more modulo operations with the third number. In anexample in which the third number is 16, the second HARQ Process numbermay be equal to (the first HARQ process number+1)modulo 16. In someexamples, the fourth number is equal to (and/or based on) the firstnumber of SLIVs divided by the second number corresponding to theaggregation factor. In some examples, a ceil (e.g., ceiling) operationand/or a floor operation may be performed to determine the fourthnumber. For example, a value (e.g., the first number of SLIVs divided bythe second number corresponding to the aggregation factor) may berounded up (e.g., rounded up, according to a ceil operation, to thelowest integer higher than the value) or rounded down (e.g., roundeddown, according to a floor operation, to the highest integer lower thanthe value) to determine the fourth number. In some examples, a number ofcyclic repetitions of the cyclic repetitions in the pattern may be equalto the first number of SLIVs. Alternatively and/or additionally, anumber of HARQ process numbers in the pattern (e.g., a total number ofHARQ process numbers in the pattern, such as including one or morerepetitions of one or more HARQ process numbers) may be equal to thefirst number of SLIVs. Alternatively and/or additionally, the cyclicrepetitions may be applied to a plurality of slots (e.g., a plurality ofconsecutive slots starting with slot n+k2). Each cyclic repetition ofthe cyclic repetitions may be applied to a set of slots of the pluralityof slots. In an example in which the first number of SLIVs is 4 (and thenumber of cyclic repetitions of the cyclic repetitions is 4, forexample), a first set of slots of the plurality of slots may correspondto a first cyclic repetition of the cyclic repetitions (e.g., an initialslot of the first set of slots may be associated with the first HARQprocess number, a second slot of the first set of slots may beassociated with the second HARQ process number equal to the first HARQprocess number+1, . . . , a last slot of the first set of slots may beassociated with the last HARQ process number), a second set of slots ofthe plurality of slots may correspond to a second cyclic repetition ofthe cyclic repetitions (e.g., an initial slot of the second set of slotsmay be associated with the first HARQ process number, a second slot ofthe second set of slots may be associated with the second HARQ processnumber equal to the first HARQ process number+1, . . . , a last slot ofthe second set of slots may be associated with the last HARQ processnumber), a third set of slots of the plurality of slots may correspondto a third cyclic repetition of the cyclic repetitions (e.g., an initialslot of the third set of slots may be associated with the first HARQprocess number, a second slot of the third set of slots may beassociated with the second HARQ process number equal to the first HARQprocess number+1, . . . , a last slot of the third set of slots may beassociated with the last HARQ process number), and a fourth set of slotsof the plurality of slots may correspond to a fourth cyclic repetitionof the cyclic repetitions (e.g., an initial slot of the fourth set ofslots may be associated with the first HARQ process number, a secondslot of the fourth set of slots may be associated with the second HARQprocess number equal to the first HARQ process number+1, . . . , a lastslot of the fourth set of slots may be associated with the last HARQprocess number). An example of the pattern is shown in FIG. 9. In theexample shown in FIG. 9, the pattern may be performed based on at leastsome of information 902, and/or the pattern may comprise cyclicrepeating 904 of {the first HARQ process number, the first HARQ processnumber+1, . . . , the first HARQ process number+the fourth number−1},wherein the pattern is complete 906 upon a number of HARQ processnumbers in the pattern (e.g., a total number of HARQ process numbers inthe pattern, such as including one or more repetitions of one or moreHARQ process numbers) reaching the first number of SLIVs.

In some examples, if the second number corresponding to the aggregationfactor is smaller than or equal to the first number of SLIVs, thepattern may be one or more rounds of HARQ process numbers. An initialround of the one or more rounds comprises repetitions of the first HARQprocess number, wherein a number of repetitions of the repetitions ofthe first HARQ process number is the second number corresponding to theaggregation factor (e.g., for the initial round of the one or morerounds, the first HARQ process number is repeated one or more times,wherein the one or more times is equal to the second numbercorresponding to the aggregation factor). Each round of one or morefollowing rounds, of the one or more rounds, that follow the initialround may comprise repetitions of an associated HARQ process number,wherein a number of repetitions of the repetitions of the associatedHARQ process number is a fifth number, and wherein the associated HARQprocess number is equal to a sum of the second number corresponding tothe aggregation factor and a preceding HARQ process number associatedwith a preceding round preceding the round (e.g., a preceding HARQprocess number associated with a preceding round directly preceding theround, such as the first HARQ process number associated with the initialround). The fifth number may be a minimum (e.g., a lowest number) among:(i) the first number of SLIVs minus the second number corresponding tothe aggregation factor, and (ii) the second number corresponding to theaggregation factor. For example, if the first number of SLIVs minus thesecond number corresponding to the aggregation factor is larger than thesecond number corresponding to the aggregation factor, the fifth numbermay be equal to the second number corresponding to the aggregationfactor. Alternatively and/or additionally, if the first number of SLIVsminus the second number corresponding to the aggregation factor issmaller than the second number corresponding to the aggregation factor,the fifth number may be equal to the first number of SLIVs minus thesecond number corresponding to the aggregation factor. In an example,the one or more following rounds that follow the initial round comprisea second round following (e.g., directly following) the initial roundand a third round following (e.g., directly following) the second round.The second round may comprise repetitions of a second HARQ processnumber (e.g., a first associated HARQ process number), wherein a numberof repetitions of the repetitions of the second HARQ process number inthe second round is the fifth number, and wherein the second HARQprocess number is equal to a sum of the second number corresponding tothe aggregation factor and the first HARQ process number. Alternativelyand/or additionally, the third round may comprise repetitions of a thirdHARQ process number (e.g., a second associated HARQ process number),wherein a number of repetitions of the repetitions of the third HARQprocess number in the third round is the fifth number, and wherein thethird HARQ process number is equal to a sum of the second numbercorresponding to the aggregation factor and the second HARQ processnumber. In some examples, the length of the pattern (e.g., a number ofslots of the pattern) may be (and/or may be based on) the first numberof SLIVs. In some examples, the one or more rounds may be applied to aplurality of slots (e.g., a plurality of consecutive slots starting withslot n+k2). Each round of the one or more rounds may be applied to a setof slots of the plurality of slots. In an example, a first set of slotsof the plurality of slots may correspond to the initial round of the oneor more rounds (e.g., the first set of slots may be associated with thefirst HARQ process number, such as where each slot of the first set ofslots is associated with a repetition of the first HARQ process numberin the initial round and/or where a number of slots of the first set ofslots is equal to the second number corresponding to the aggregationfactor), a second set of slots of the plurality of slots may correspondto the second round of the one or more rounds (e.g., the second set ofslots may be associated with the second HARQ process number, such aswhere each slot of the second set of slots is associated with arepetition of the second HARQ process number in the second round and/orwhere a number of slots of the second set of slots is equal to the fifthnumber), etc.

In some examples, the pattern comprises sequentially repeating the firstHARQ process number and one or more associated HARQ process numbers. Insome examples, each HARQ process number of the one or more associatedHARQ process numbers may be equal to the first HARQ process number plusa factor of the second number corresponding to the aggregation factor.For example, the one or more associated HARQ process numbers maycomprise at least one of a first associated HARQ process number equal tothe first HARQ process number+(1×the second number corresponding to theaggregation factor), a second associated HARQ process number equal tothe first HARQ process number+(2×the second number corresponding to theaggregation factor), a third associated HARQ process number equal to thefirst HARQ process number+(3×the second number corresponding to theaggregation factor), etc.

An example of the pattern is shown in FIG. 10. In the example shown inFIG. 10, the pattern may be performed based on at least some ofinformation 1002. The pattern may comprise, in 1004, repeating of thefirst HARQ process number (e.g., HARQ process number X is set to thefirst HARQ process number for an initial instance of 1004), wherein anumber of the repetitions of the first HARQ process number in 1004 is aminimum (e.g., a lowest number) among: (i) a remaining number until thefirst number of SLIVs (e.g., the remaining number until the first numberof SLIVs may be equal to the first number of SLIVs at the beginning ofthe pattern), and (ii) the second number corresponding to theaggregation factor. In an example, the remaining number until the firstnumber of SLIVs may be equal to the first number of SLIVs minus a numberof HARQ process numbers in the pattern thus far (e.g., a total number ofHARQ process numbers in the pattern thus far, such as including one ormore repetitions of one or more HARQ process numbers). At 1010, if thefirst number of SLIVs is reached for the pattern (e.g., if the number ofHARQ process numbers in the pattern reaches the first number of SLIVs),the pattern is completed 1008. Otherwise, if the first number of SLIVsis not reached for the pattern, at 1006, HARQ process number X may beupdated by setting HARQ process number X to a HARQ process number equalto HARQ process number X+the second number corresponding to theaggregation factor (e.g., such that the updated HARQ process number X isrepeated one or more times in 1004). Acts 1004 and/or 1006 may beperformed until it is determined 1010 that the first number of SLIVs isreached for the pattern (indicating completion 1008 of the pattern). Inan example in which the first number of SLIVs is 8, the second numbercorresponding to the aggregation factor is 2, and the first HARQ processnumber is 3, the pattern according to the example in FIG. 10 may be {3,3, 5, 5, 7, 7, 9, 9}.

In some examples, the pattern comprises n repetitions of each HARQprocess number of HARQ process numbers from the first HARQ processnumber to a last HARQ process number (e.g., n is equal to and/or basedon the second number corresponding to the aggregation factor). In someexamples, the last HARQ process number may be equal to the first HARQprocess number+the first number (e.g., the first number of SLIVs)−1. Insome examples, the HARQ process numbers may comprise each HARQ processnumber (e.g., each HARQ process number supported and/or used by the UEand/or each HARQ process number that the UE is configured with) from thefirst HARQ process number to the last HARQ process number (e.g., if thefirst HARQ process number is 3 and the last HARQ process number is 6,the HARQ process numbers may comprise HARQ process numbers 3, 4, 5, and6). Alternatively and/or additionally, a modulo operation with the thirdnumber (e.g., the number of HARQ process numbers supported and/or usedby the UE and/or the number of HARQ process numbers that the UE isconfigured with) may be performed to determine the last HARQ processnumber. In an example in which the third number is 16, the last HARQprocess number may be equal to (the first HARQ process number+the firstnumber−1) modulo 16. In an example, n repetitions of each HARQ processnumber of the HARQ process numbers may be performed in sequential order.For example, the pattern may comprise n repetitions of the first HARQprocess number, followed by n repetitions of the first HARQ processnumber+1, . . . , followed by n repetitions of the last HARQ processnumber. In an example in which the first HARQ process number is 3 andthe last HARQ process number is 6, the pattern may comprise nrepetitions of HARQ process number 3, followed by n repetitions of HARQprocess number 4, followed by n repetitions of HARQ process number 5,followed by n repetitions of HARQ process number 6 (e.g., if n=2, thepattern comprises {3, 3, 4, 4, 5, 5, 6, 6}). The pattern may be appliedto a plurality of slots (e.g., a plurality of consecutive slots startingwith slot n+k2). In an example in which the first HARQ process number is3 and the last HARQ process number is 6, a first set of slots (e.g., afirst set of n slots of the plurality of slots) may be associated withHARQ process number 3, a second set of slots (e.g., a second set of nslots of the plurality of slots) may be associated with HARQ processnumber 4, a third set of slots (e.g., a third set of n slots of theplurality of slots) may be associated with HARQ process number 5 and/ora fourth set of slots (e.g., a fourth set of n slots of the plurality ofslots) may be associated with HARQ process number 6. An example is shownin Option 4 of FIG. 11, where for HARQ process number {3, 4, 5, 6}, eachHARQ process number repeats two times (e.g., the pattern is HARQ processnumbers {3, 3, 4, 4, 5, 5, 6, 6}).

In some examples, the pattern comprises sequential repetitions of eachHARQ process number among HARQ process numbers comprising the first HARQprocess number and one or more associated HARQ process numbers. Forexample, the pattern may comprise n repetitions of the first HARQprocess number, followed by n repetitions of a second HARQ processnumber equal to the first HARQ process number+1, . . . , followed by nrepetitions of a last HARQ process number equal to the first HARQprocess number plus the first number (e.g., the first number of SLIVs)minus 1 (e.g., n is equal to and/or based on the second numbercorresponding to the aggregation factor). In an example, the patterncomprises sets of n repetitions of HARQ process numbers. An initial setof n repetitions of the first HARQ process number. For each set of nrepetitions following the initial set of n repetitions, a preceding HARQprocess number associated with a preceding set of n repetitions (e.g., apreceding HARQ process number associated with a preceding set of nrepetitions directly preceding the set of n repetitions) may beincreased (e.g., incremented by 1) to determine a HARQ process numberfor the set of n repetitions. The set of n repetitions are performeduntil a set of n repetitions of the last HARQ process number iscompleted. Each set of n repetitions of the sets of n repetitions may beapplied to a set of slots of the plurality of slots. In an example, afirst set of slots of the plurality of slots may correspond to theinitial set of n repetitions (e.g., the first set of slots may beassociated with the first HARQ process number, such as where each slotof the first set of slots is associated with a repetition of the firstHARQ process number in the initial set of n repetitions and/or where anumber of slots of the first set of slots is equal to n), a second setof slots of the plurality of slots may correspond to a second set of nrepetitions (e.g., the second set of slots may be associated with asecond HARQ process number equal to the first HARQ process number plus1, such as where each slot of the second set of slots is associated witha repetition of the second HARQ process number in the second set of nrepetitions and/or where a number of slots of the second set of slots isequal to n), etc.

In some examples, if the second number corresponding to the aggregationfactor is smaller than or equal to the first number of SLIVs, thepattern may be one or more rounds of HARQ process numbers. An initialround of the one or more rounds comprises repetitions of the first HARQprocess number, wherein a number of repetitions of the repetitions ofthe first HARQ process number is the second number corresponding to theaggregation factor (e.g., for the initial round of the one or morerounds, the first HARQ process number is repeated one or more times,wherein the one or more times is equal to the second numbercorresponding to the aggregation factor). For each round (of the one ormore rounds) that follow the initial round, a preceding HARQ processnumber associated with a preceding round (e.g., a preceding HARQ processnumber associated with a preceding round directly preceding the round)may be increased (e.g., incremented by 1) to determine a HARQ processnumber for the round, and a set of m repetitions of the HARQ processnumber is performed in the round. In some examples, the one or morerounds are performed until a round comprising a set of repetitions of alast HARQ process number (e.g., a set of m repetitions of the last HARQprocess number) is performed and/or completed. In some examples, thelast HARQ process number is equal to the first HARQ process number plusthe fourth number (e.g., the first number of SLIVs divided by the secondnumber corresponding to the aggregation factor). In some examples, m maybe a minimum (e.g., a lowest number) among: (i) the first number ofSLIVs minus the second number corresponding to the aggregation factor,and (ii) the second number corresponding to the aggregation factor. Inan example, one or more following rounds that follow the initial roundcomprise a second round following (e.g., directly following) the initialround and a third round following (e.g., directly following) the secondround. The second round may comprise m repetitions of a second HARQprocess number equal to the first HARQ process number+1. Alternativelyand/or additionally, the third round may comprise m repetitions of athird HARQ process number equal to the second HARQ process number+1. Insome examples, the length of the pattern (e.g., a number of slots of thepattern) may be (and/or may be based on) the first number of SLIVs. Insome examples, the one or more rounds may be applied to a plurality ofslots (e.g., a plurality of consecutive slots starting with slot n+k2).Each round of the one or more rounds may be applied to a set of slots ofthe plurality of slots. In an example, a first set of slots of theplurality of slots may correspond to the initial round of the one ormore rounds (e.g., the first set of slots may be associated with thefirst HARQ process number, such as where each slot of the first set ofslots is associated with a repetition of the first HARQ process numberin the initial round and/or where a number of slots of the first set ofslots is equal to the second number corresponding to the aggregationfactor), a second set of slots of the plurality of slots may correspondto the second round of the one or more rounds (e.g., the second set ofslots may be associated with the second HARQ process number, such aswhere each slot of the second set of slots is associated with arepetition of the second HARQ process number in the second round and/orwhere a number of slots of the second set of slots is equal to m), etc.

In some examples, the pattern comprises sequentially repeating the firstHARQ process number and one or more HARQ process numbers. In someexamples, the one or more HARQ process numbers may be consecutive HARQprocess numbers that follow the first HARQ process number (e.g., withmodulo operation).

An example of the pattern is shown in FIG. 12. In the example shown inFIG. 12, the pattern may be performed based on at least some ofinformation 1202. The pattern may comprise sequential repeating 1204 ofeach HARQ process number of at least some of HARQ process numbers {thefirst HARQ process number, the first HARQ process number+1, . . . , thefirst HARQ process number+the fourth number−1}, wherein each HARQprocess number of at least some of the HARQ process numbers is repeateda number of times equal to the second number of times, and/or whereinthe pattern is complete 1206 upon a number of HARQ process numbers inthe pattern (e.g., a total number of HARQ process numbers in thepattern, such as including one or more repetitions of one or more HARQprocess numbers) reaching the first number of SLIVs. In an example inwhich the first number of SLIVs is 8, the second number corresponding tothe aggregation factor is 2, and the first HARQ process number is 3, thepattern according to the example in FIG. 12 may be {3, 3, 4, 4, 5, 5, 6,6} (e.g., there are no HARQ process numbers 7˜10 in the pattern).

In some examples, the DCI schedules resource allocation (e.g., timeresource allocation) within slots for one or more TBs. In some examples,a resource allocation (e.g., a time resource allocation) within a slotis indicative of OFDM symbols (e.g., consecutive OFDM symbols) withinthe slot. For example, the resource allocation may be indicative of astarting OFDM symbol of the OFDM symbols and/or a length of consecutiveOFDM symbols (e.g., the length may correspond to a number of OFDMsymbols of the OFDM symbols associated with the resource allocation,wherein the starting OFDM symbol is included in the length). The DCI mayschedule the same resource allocation (e.g., the same time resourceallocation) within each slot for a TB of the one or more TBs. Forexample, OFDM symbols for transmission of a first TB, of the one or moreTBs, in a first slot may be the same as OFDM symbols for transmission ofthe first TB in a second slot. Alternatively and/or additionally, theDCI may schedule the same resource allocation (e.g., the same timeresource allocation) within each slot for multiple TBs of the one ormore TBs. For example, OFDM symbols for transmission of a first TB, ofthe one or more TBs, in a first slot may be the same as OFDM symbols fortransmission of a second TB, of the one or more TBs, in a second slot.Alternatively and/or additionally, the DCI may schedule differentresource allocations (e.g., different time resource allocations) withinslots for a TB of the one or more TBs. For example, OFDM symbols fortransmission of a first TB, of the one or more TBs, in a first slot maybe different from OFDM symbols for transmission of the first TB in asecond slot. Alternatively and/or additionally, the DCI may scheduledifferent resource allocations (e.g., different time resourceallocations) within slots for multiple TBs of the one or more TBs. Forexample, OFDM symbols for transmission of a first TB, of the one or moreTBs, in a first slot may be different from OFDM symbols for transmissionof a second TB, of the one or more TBs, in a second slot.

FIG. 11 illustrates examples of the pattern (of resource allocation, forexample) across a plurality of slots, where the second numbercorresponding to the aggregation factor (e.g., a slot aggregation numberwith which the UE is configured) is smaller than or equal to the firstnumber of SLIVs. The UE receives a DCI in slot n, wherein the DCIindicates a slot offset (e.g., k2) for an initial scheduled transmission(e.g., an initial transmission scheduled by the DCI is scheduled forslot n+k2). In the example shown in FIG. 11, the second numbercorresponding to the aggregation factor is 2 (e.g., the UE is configuredwith a slot aggregation number “2”). In the example shown in FIG. 11,the first number of SLIVs is 4. For example, the first number of SLIVsis 4 based on the DCI indicating an entry (of the list 600 of FIG. 6,for example) comprising 4 SLIVs (e.g., the DCI may comprise anindication of entry index 5 corresponding to the entry 5 of the list 600of FIG. 6). Alternatively and/or additionally, the DCI may be indicativeof the first HARQ process number (for the initial scheduled transmissionand/or the first scheduled SLIV, for example).

FIG. 11 shows example patterns of Options 1-5. For each option, FIG. 11shows HARQ process numbers, of the pattern, associated with slots (e.g.,consecutive slots) starting with slot n+k2.

In Option 1, the pattern may correspond to HARQ process numbers {3, 4,5, 6, 3, 4, 5, 6} across the plurality of slots (e.g., the plurality ofslots comprises 8 slots). For example, the plurality of slots (to whichthe pattern is applied) comprises a first set of slots comprising slots(e.g., 4 slots) from slot n+k2 to slot n+k2+3 associated with HARQprocess numbers {3, 4, 5, 6}, respectively. The plurality of slotscomprises a second set of slots comprising slots (e.g., 4 slots),wherein HARQ process numbers applied to the second set of slots,respectively, are the same as (e.g., a repetition of) the HARQ processnumbers applied to the first set of slots. For example, repeated HARQprocess numbers (associated with the second set of slots, for example)follow original HARQ process numbers (associated with the first set ofslots, for example).

In Option 2, the pattern may correspond to HARQ process numbers {3, 4,3, 4} across the plurality of slots (e.g., the plurality of slotscomprises 4 slots). In some examples, a number (e.g., a total number,such as 4) of the HARQ process numbers (e.g., including repetitions ofHARQ process numbers) of the pattern and/or a number of slots associatedwith the pattern are based on the first number of SLIVs (e.g., a numberof SLIVs in the indicated entry, such as #SLIVs) being 4. For example,the number of the HARQ process numbers and/or the number of the slotsmay be equal to (and/or based on) the first number of SLIVs. In someexamples, a number of unique HARQ process numbers of the HARQ processnumbers may be determined based on (e.g., may be derived from) the firstnumber of SLIVs (e.g., 4) divided by the aggregation factor (e.g., 2).In some examples, a ceil (e.g., ceiling) operation and/or a flooroperation may be performed to determine the number of unique HARQprocess numbers. For example, a value (e.g., the first number of SLIVsdivided by the aggregation factor) may be rounded up (e.g., rounded up,according to a ceil operation, to the lowest integer higher than thevalue) or rounded down (e.g., rounded down, according to a flooroperation, to the highest integer lower than the value) to determine thenumber of unique HARQ process numbers. In the example shown in FIG. 11,the number of unique HARQ process numbers of the pattern is 2 (whereunique HARQ process numbers of the pattern are 3 and 4, for example).

In Option 3, the pattern may correspond to HARQ process numbers {3, 3,5, 5} across the plurality of slots (e.g., the plurality of slotscomprises 4 slots). In some examples, a number (e.g., a total number,such as 4) of the HARQ process numbers (e.g., including repetitions ofHARQ process numbers) of the pattern and/or a number of slots associatedwith the pattern are based on the first number of SLIVs (e.g., a numberof SLIVs in the indicated entry, such as #SLIVs) being 4. For example,the number of the HARQ process numbers and/or the number of the slotsmay be equal to (and/or based on) the first number of SLIVs. In someexamples, HARQ process number 3 is repeated for one or more consecutiveslots, wherein a number of slots of the one or more consecutive slots isequal to the aggregation factor (e.g., the one or more consecutive slotscomprise slot n+k2). The one or more consecutive slots are followed byone or more second consecutive slots, wherein an associated HARQ processnumber is repeated for the one or more second consecutive slots. In theexample, the one or more consecutive slots in which the first HARQprocess number (e.g., 3) is repeated comprise slot n+k2 and slot n+k2+1,and the one or more second consecutive slots in which the associatedHARQ process number is repeated comprise slot n+k2+2 and slot n+k2+3. Insome examples, the associated HARQ process number is 5. For example, theassociated HARQ process number associated with the one or more secondconsecutive slots may be equal to (and/or based on) the first HARQprocess number (e.g., 3) plus the aggregation factor (e.g., 2). In someexamples, UE does not use (and/or does not consider to use) HARQ processnumber 4 in the example shown in FIG. 11.

In Option 4, the pattern may correspond to HARQ process numbers {3, 3,4, 4, 5, 5, 6, 6} across the plurality of slots (e.g., the plurality ofslots comprises 8 slots). In some examples, for each HARQ process numberof HARQ process numbers 3˜6, the HARQ process number may repeated overslots amounting to the aggregation factor (e.g., 2 slots due to theaggregation factor being equal to 2). In some examples, a number ofslots (e.g., 8) of the plurality of slots is based on the first numberof SLIVs and the aggregation factor (e.g., the number of slots may beequal to the first number of SLIVs multiplied by the aggregationfactor).

In Option 5, the pattern may correspond to HARQ process numbers {3,3, 4,4} across the plurality of slots (e.g., the plurality of slots comprises4 slots). In some examples, a number (e.g., a total number, such as 4)of the HARQ process numbers (e.g., including repetitions of HARQ processnumbers) of the pattern and/or a number of slots associated with thepattern are based on the first number of SLIVs (e.g., a number of SLIVsin the indicated entry, such as #SLIVs) being 4. For example, the numberof the HARQ process numbers and/or the number of the slots may be equalto (and/or based on) the first number of SLIVs. In some examples, HARQprocess number 3 is repeated for one or more consecutive slots, whereina number of slots of the one or more consecutive slots is equal to theaggregation factor (e.g., the one or more consecutive slots compriseslot n+k2). The one or more consecutive slots are followed by one ormore second consecutive slots, wherein a consecutive HARQ process numberis repeated for the one or more second consecutive slots. In theexample, the one or more consecutive slots in which the first HARQprocess number (e.g., 3) is repeated comprise slot n+k2 and slot n+k2+1,and the one or more second consecutive slots in which the consecutiveHARQ process number is repeated comprise slot n+k2+2 and slot n+k2+3. Insome examples, the consecutive HARQ process number is 4. For example,the consecutive HARQ process number associated with the one or moresecond consecutive slots may be equal to (and/or based on) the firstHARQ process number (e.g., 3) plus 1 (e.g., the consecutive HARQ processnumber may correspond to a HARQ process number consecutively followingthe first HARQ process number).

In some examples, the pattern may be specified and/or fixed in astandard.

In some examples, the pattern may be configured (e.g., pre-configured)by a network (e.g., the UE may be configured with the pattern byreceiving a configuration and/or an indication of the pattern from thenetwork).

In some examples, a same HARQ process number corresponds to a same TB.For example, if a first slot and a second slot are associated with thesame HARQ process number, the same TB may be transmitted via the firstslot and via the second slot.

In some examples, a same HARQ process number corresponds to a same SLIV.For example, if a first slot and a second slot are associated with thesame HARQ process number, the first slot and the second slot may beassociated with the same SLIV.

In some examples, a same HARQ process number corresponds to a samemapping type. For example, if a first slot and a second slot areassociated with the same HARQ process number, the first slot and thesecond slot may be associated with the same mapping type.

FIG. 13 shows examples of the pattern (of resource allocation, forexample) across a plurality of slots, where the second numbercorresponding to the aggregation factor (e.g., a slot aggregation numberwith which the UE is configured) is smaller than or equal to the firstnumber of SLIVs. The UE receives a DCI in slot n, wherein the DCIindicates a slot offset (e.g., k2) for an initial scheduled transmission(e.g., an initial transmission scheduled by the DCI is scheduled forslot n+k2). In the example shown in FIG. 13, the second numbercorresponding to the aggregation factor is 2 (e.g., the UE is configuredwith a slot aggregation number “2”). In the example shown in FIG. 13,the first number of SLIVs is 4. For example, the first number of SLIVsis 4 based on the DCI indicating an entry (of the list 600 of FIG. 6,for example) comprising 4 SLIVs (e.g., the DCI may comprise anindication of entry index 5 corresponding to the entry 5 of the list 600of FIG. 6). Alternatively and/or additionally, the DCI may be indicativeof the first HARQ process number (for the initial scheduled transmissionand/or the first scheduled SLIV, for example).

For each option, FIG. 13 shows SLIVs, of the pattern, associated withthe plurality of slots (e.g., consecutive slots) starting with slotn+k2. In some examples, HARQ process numbers shown in each option ofFIG. 11 may be associated with the SLIVs shown in each option of FIG.13, respectively. The SLIVs are based on the entry (e.g., entry 5)indicated by the DCI received by the UE.

In some examples, HARQ process numbers according to Option 1 and/orOption 4 in FIG. 11 are associated with SLIVs according to Option 1and/or Option 4 in FIG. 13, respectively.

In some examples, HARQ process numbers according to Option 2, Option 3and/or Option 5 in FIG. 11 are associated with SLIVs according to Option2, Option 3 and/or Option 5 in FIG. 13, respectively.

In some examples, UE may determine (e.g., derive) a length of thepattern (e.g., a number of slots of the pattern) based on aconfiguration (e.g., a pre-configuration) by the network.

In some examples, UE may determine (e.g., derive) the length of thepattern (e.g., a number of slots of the pattern) based on a fixed valueand/or a value specified in a specification.

In an example, the length of the pattern is 6, the UE is configured withslot aggregation number “2”, and the UE receives a DCI, wherein the DCIis indicative of 4 SLIVs (e.g., the first number of SLIVs is 4 based onan entry indicated by the DCI comprising 4 SLIVs), and the DCI isindicative of the first HARQ process number (for an initial scheduledSLIV, for example) being 3. In the example, if the pattern is determinedaccording to Option 1, the UE may determine (e.g., derive, identifyand/or consider) the pattern to be {3, 4, 5, 6, 3, 4} for Option 1.Alternatively and/or additionally, in the example, if the pattern isdetermined according to Option 2, the pattern may be {3, 4, 5, 3, 4, 5}.Alternatively and/or additionally, in the example, if the pattern isdetermined according to Option 3, the pattern may be {3, 3, 5, 5, 3, 3}.Alternatively and/or additionally, in the example, if the pattern isdetermined according to Option 4 the pattern may be {3, 3, 4, 4, 5, 5}.Alternatively and/or additionally, in the example, if the pattern isdetermined according to Option 5, the pattern may be {3, 3, 4, 4, 5, 5}.

FIGS. 14-16 show other examples of the pattern with respect to variousoptions (e.g., Options 1-5). FIG. 14 shows examples of the pattern (ofresource allocation, for example) across a plurality of slots, where thesecond number corresponding to the aggregation factor (e.g., a slotaggregation number with which the UE is configured) is smaller than orequal to the first number of SLIVs, and wherein the first number ofSLIVs is an odd number. FIG. 15 shows examples of the pattern (ofresource allocation, for example) across a plurality of slots, where thesecond number corresponding to the aggregation factor (e.g., a slotaggregation number with which the UE is configured) is larger than thefirst number of SLIVs. FIG. 16 shows examples of the pattern (ofresource allocation, for example) across a plurality of slots, where thesecond number corresponding to the aggregation factor (e.g., a slotaggregation number with which the UE is configured) is larger than thefirst number of SLIVs, and wherein the first number of SLIVs is an oddnumber.

A second concept of the present disclosure is a limitation (e.g., arestriction) is applied. For example, the limitation may be applied to aUE and/or a network. The limitation may be that merely one ofmulti-PUSCHs functionality (e.g., multi-TB) or PUSCHaggregation/repetition functionality (e.g., PUSCH aggregation factor)can be configured and/or provided (for the UE, for example). Forexample, the limitation may be that the UE may not be configured and/orprovided with both multi-PUSCHs functionality (e.g., multi-TB) and PUSCHaggregation/repetition functionality (e.g., PUSCH aggregation factor)concurrently (e.g., simultaneously). For example, the UE may beconfigured and/or provided with either multi-PUSCHs functionality (e.g.,multi-TB) or PUSCH aggregation/repetition functionality (e.g., PUSCHaggregation factor).

In an example, if the UE is configured with a multi-PUSCHsfunctionality-related configuration (e.g., a multi-TB-relatedconfiguration), such as wherepusch-TimeDomainAllocationListForMultiPUSCH-r16 is enabled, the UE isnot expected (and/or does not expect) to be configured with PUSCHaggregation/repetition functionality. For example, the UE is notexpected (and/or does not expect) to be configured with aggregationfactor if the UE is configured with a multi-PUSCHs functionality-relatedconfiguration (e.g., a multi-TB-related configuration), such as wherepusch-TimeDomainAllocationListForMultiPUSCH-r16 is enabled.Alternatively and/or additionally, the UE is not expected (and/or doesnot expect) to be configured with repetition number if the UE isconfigured with a multi-PUSCHs functionality-related configuration(e.g., a multi-TB-related configuration), such as wherepusch-TimeDomainAllocationListForMultiPUSCH-r16 is enabled.

In an example, if the UE is configured with PUSCH aggregation/repetitionfunctionality (e.g., if the UE is configured with aggregation factor),the UE is not expected (and/or does not expect) to be configured with amulti-PUSCHs functionality-related configuration (e.g., amulti-TB-related configuration) (e.g., the UE is not expected and/ordoes not expect to enablepusch-TimeDomainAllocationListForMultiPUSCH-r16).

In some examples, the network is not configured to configure (e.g., thenetwork is not allowed to configure, is prohibited from configuring,and/or is prevented from configuring) the UE with both a multi-PUSCHsfunctionality-related configuration (e.g., a multi-TB-relatedconfiguration) and a PUSCH aggregation/repetition configuration and/orparameter (e.g., an aggregation factor configuration and/or parameter),concurrently (e.g., simultaneously).

In some examples, in response to (and/or after) being configured with amulti-PUSCHs functionality-related configuration (e.g., amulti-TB-related configuration), the UE may ignore (and/or may not applyand/or implement) a PUSCH aggregation/repetition functionality-relatedconfiguration (e.g., an aggregation factor-related configuration). Forexample, the UE may ignore (e.g., the UE may not apply and/or implement)a PUSCH aggregation/repetition functionality-related configuration(e.g., an aggregation factor-related configuration) when the UE isconfigured with a multi-PUSCHs functionality-related configuration(e.g., a multi-TB-related configuration).

In some examples, in response to (and/or after) receiving aconfiguration of both multi-PUSCHs functionality (e.g., multi-TB) andPUSCH aggregation/repetition functionality (e.g., PUSCH aggregationfactor), the UE may report (e.g., transmit) a message to the network forreconfiguration. For example, the UE may report the message to thenetwork for reconfiguration in response to being configured with bothmulti-PUSCHs functionality (e.g., multi-TB) and PUSCHaggregation/repetition functionality (e.g., PUSCH aggregation factor)concurrently (e.g., simultaneously). In some examples, in response toreceiving the message, the network may configure the UE with merely oneof multi-PUSCHs functionality (e.g., multi-TB) and PUSCHaggregation/repetition functionality (e.g., PUSCH aggregation factor).

To enhance 3GPP specification for wireless communication in accordancewith some embodiments herein, Enhancements 1-7 are provided herein.Enhancements 1-7 are reflective of implementation in accordance withsome embodiments herein, and comprise additions to various sections of3GPP specifications. According to some embodiments, one, some and/or allof Enhancements 1-7 may be implemented and/or a portion of one, someand/or all of Enhancements 1-7 may be implemented.

Enhancement 1 comprises an addition to 3GPP TS 38.331 V16.2.0. Anoriginal portion of 3GPP TS 38.331 V16.2.0, without any addition ofEnhancement 1, is quoted in the following quotation (some parts of theoriginal portion are not included in the quotation):

PUSCH-Config

The IE PUSCH-Config is used to configure the UE specific PUSCHparameters applicable to a particular BWP.

PUSCH-Config Information Element

-- ASN1START -- TAG-PUSCH-CONFIG-START PUSCH-Config ::= SEQUENCE {  ... pusch-TimeDomainAllocationList  SetupRelease { PUSCH-TimeDomainResourceAllocationList }   OPTIONAL, -- Need M pusch-AggregationFactor  ENUMERATED { n2, n4, n8 } OPTIONAL, -- Need S...pusch-AggregationFactorNumber of repetitions for data (see TS 38.214 [19], clause 6.1.2.1). Ifthe field is absent the UE applies the value 1.

In Enhancement 1, addition 1 is made to the original portion of 3GPP TS38.331 V16.2.0 in accordance with some embodiments of the presentdisclosure. To distinguish addition 1 from what is originally includedin the original portion of 3GPP TS 38.331 V16.2.0, addition 1 is inbold, and is preceded by the term “ADDITION 1 STARTS:” and followed bythe term “ADDITION 1 ENDS”.

Enhancement 1:

PUSCH-Config

The IE PUSCH-Config is used to configure the UE specific PUSCHparameters applicable to a particular BWP.

PUSCH-Config Information Element

-- ASN1START -- TAG-PUSCH-CONFIG-START PUSCH-Config ::= SEQUENCE {  ... pusch-TimeDomainAllocationList  SetupRelease { PUSCH-TimeDomainResourceAllocationList }   OPTIONAL, -- Need M pusch-AggregationFactor  ENUMERATED { n2, n4, n8 } OPTIONAL, -- Need S...pusch-AggregationFactorNumber of repetitions for data (see TS 38.214 [19], clause 6.1.2.1). Ifthe field is absent the UE applies the value 1. ADDITION 1 STARTS: Ifpusch-TimeDomainAllocationListForMultiPUSCH-r16 is configured, the fieldis absent.

ADDITION 1 ENDS

For example, Enhancement 1 provides that ifpusch-TimeDomainAllocationListForMultiPUSCH-r16 is configured (for theUE, for example), a field (e.g., pusch-AggregationFactor field) isabsent (e.g., absent from the PUSCH-Config information element). Forexample, the PUSCH-Config information element may be configured (by thenetwork, for example) such that the field (e.g., pusch-AggregationFactorfield) is absent when the UE is configured withpusch-TimeDomainAllocationListForMultiPUSCH-r16.

Enhancement 2 comprises an addition (Addition 2) to Section 6.1.2.1 of3GPP TS 38.214 V16.3.0. Section 6.1.2.1 of 3GPP TS 38.214 V16.3.0 isentitled Resource allocation in time domain.

Enhancement 2:

ADDITION 2 STARTS:

If a UE is configured with higher layer parameterpusch-TimeDomainAllocationListForMultiPUSCH-r16, the UE does not expectto be configured with pusch-AggregationFactor.

ADDITION 2 ENDS

Enhancement 3 comprises an addition to Section 6.1.2.1 of 3GPP TS 38.214V16.3.0. An original portion of Section 6.1.2.1 of 3GPP TS 38.214V16.3.0, without any addition of Enhancement 3, is quoted in thefollowing quotation (some parts of the original portion are not includedin the quotation):

6.1.2 Resource Allocation 6.1.2.1 Resource Allocation in Time Domain

. . .For PUSCH repetition Type A, when transmitting PUSCH scheduled by DCIformat 0_1 or 0_2 in PDCCH with CRC scrambled with C-RNTI, MCS-C-RNTI,or CS-RNTI with NDI=1, the number of repetitions K is determined as

-   -   if numberOfRepetitions-r16 is present in the resource allocation        table, the number of repetitions K is equal to        numberOfRepetitions-r16;    -   elseif the UE is configured with pusch-AggregationFactor, the        number of repetitions K is equal to pusch-AggregationFactor;    -   otherwise K=1.

In Enhancement 3, addition 3 is made to the original portion of Section6.1.2.1 of 3GPP TS 38.214 V16.3.0 in accordance with some embodiments ofthe present disclosure. To distinguish addition 3 from what isoriginally included in the original portion of Section 6.1.2.1 of 3GPPTS 38.214 V16.3.0, addition 3 is in bold, and is preceded by the term“ADDITION 3 STARTS:” and followed by the term “ADDITION 3 ENDS”.

Enhancement 3:

6.1.2 Resource Allocation 6.1.2.1 Resource Allocation in Time Domain

. . .For PUSCH repetition Type A, when transmitting PUSCH scheduled by DCIformat 0_1 or 0_2 in PDCCH with CRC scrambled with C-RNTI, MCS-C-RNTI,or CS-RNTI with NDI=1, the number of repetitions K is determined as

-   -   if numberOfRepetitions-r16 is present in the resource allocation        table, the number of repetitions K is equal to        numberOfRepetitions-r16;    -   elseif the UE is configured with pusch-AggregationFactor        ADDITION 3 STARTS: and        pusch-TimeDomainAllocationListForMultiPUSCH-r16 is not        configured ADDITION 3 ENDS, the number of repetitions K is equal        to pusch-AggregationFactor;    -   otherwise K=1.

For example, Enhancement 3 provides that, if the UE is configured withpusch-AggregationFactor andpusch-TimeDomainAllocationListForMultiPUSCH-r16 is not configured (forthe UE, for example), a number of repetitions K may be set topusch-AggregationFactor.

Enhancement 4 comprises an addition to 3GPP TS 38.331 V16.2.0. Anoriginal portion of 3GPP TS 38.331 V16.2.0, without any addition ofEnhancement 4, is quoted in the following quotation (some parts of theoriginal portion are not included in the quotation):

PUSCH-Config

The IE PUSCH-Config is used to configure the UE specific PUSCHparameters applicable to a particular BWP.

PUSCH-Config Information Element

-- ASN1START -- TAG-PUSCH-CONFIG-START PUSCH-Config ::= SEQUENCE {  ... pusch-TimeDomainAllocationList  SetupRelease { PUSCH-TimeDomainResourceAllocationList }   OPTIONAL, -- Need M pusch-AggregationFactor  ENUMERATED { n2, n4, n8 } OPTIONAL, -- Need S

In Enhancement 4, addition 4 is made to the original portion of 3GPP TS38.331 V16.2.0 in accordance with some embodiments of the presentdisclosure. To distinguish addition 4 from what is originally includedin the original portion of 3GPP TS 38.331 V16.2.0, addition 4 is inbold, and is preceded by the term “ADDITION 4 STARTS:” and followed bythe term “ADDITION 4 ENDS”.

Enhancement 4:

PUSCH-Config

The IE PUSCH-Config is used to configure the UE specific PUSCHparameters applicable to a particular BWP.

PUSCH-Config Information Element

-- ASN1START -- TAG-PUSCH-CONFIG-START PUSCH-Config ::= SEQUENCE {  ... pusch-TimeDomainAllocationList  SetupRelease { PUSCH-TimeDomainResourceAllocationList }   OPTIONAL, -- Need M pusch-AggregationFactor  ENUMERATED { n2, n4, n8 } OPTIONAL, -- Need SADDITION 4 STARTS: , and Cond NotFor-mat01-02-Or- TypeA ADDITION 4 ENDS

A third concept of the present disclosure is determining, based on afirst number of SLIVs, whether to apply a second number corresponding toa slot aggregation factor. For example, whether to apply the secondnumber (corresponding to the slot aggregation factor) is determinedbased on the first number of SLIVs. In an example, if the first numberof SLIVs is equal to a first defined number (and/or if the first numberof SLIVs is a number of a first defined set of numbers), the secondnumber corresponding to the slot aggregation factor may be applied.Alternatively and/or additionally, if the first number of SLIVs is equalto a second defined number (and/or if the second number of SLIVs is anumber of a second defined set of numbers), the second numbercorresponding to the slot aggregation factor may not be applied.

In some examples, the first defined number is 1. Alternatively and/oradditionally, the first defined set of numbers may comprise 1.

In some examples, the first defined number is an integer that isdivisible by the second number corresponding to the slot aggregationfactor (e.g., dividing the first defined number by the second numbercorresponding to the slot aggregation factor leaves no remainder).Alternatively and/or additionally, the first defined set of numbers maycomprise one or more integers that are divisible by the second numbercorresponding to the slot aggregation factor.

In an example, if the second number corresponding to the slotaggregation factor is 2, the first defined number may be 1.Alternatively and/or additionally, if the second number corresponding tothe slot aggregation factor is 2, the first set of defined numbers maycomprise 1 and/or one or more integers (e.g., one or more even integers)larger than or equal to 2.

A table 1700 associated with example scenarios is illustrated in FIG.17. In some examples, if the UE is not configured withpusch-AggregationFactor (associated with PUSCH aggregation/repetitionfunctionality, for example), a repetition number/aggregation number “K”is equal to one. The repetition number/aggregation number “K” maycorrespond to an aggregation factor (e.g., a PUSCH aggregation factor)and/or a repetition factor (e.g., a PUSCH repetition factor). If UE isconfigured with pusch-AggregationFactor (associated with PUSCHaggregation/repetition functionality, for example), and is configuredwith a first list (e.g., a multi-TB list associated with multi-PUSCHsfunctionality) with an entry (e.g., at least one entry) indicative ofmultiple SLIVs (such as the list 600 in FIG. 6), a repetitionnumber/aggregation number “K” for the one entry is 1, and/or therepetition number/aggregation number “K” for the entry is not equal to(and/or is not based on) pusch-AggregationFactor. Alternatively and/oradditionally, if UE is configured with pusch-AggregationFactor(associated with PUSCH aggregation/repetition functionality, forexample), and is configured with a first list (e.g., a multi-TB listassociated with multi-PUSCHs functionality) with an entry (e.g., atleast one entry) indicative of multiple SLIVs (such as the list 600 inFIG. 6), a repetition number/aggregation number “K” for one or moreentries in the list is 1, and/or the UE ignores and/or does not applypusch-AggregationFactor for determining repetition number/aggregationnumber “K”. For one or more entries, of the first list, that areindicative of a single SLIV (e.g., merely a single SLIV), a repetitionnumber/aggregation number “K” may be equal to (and/or based on)pusch-AggregationFactor. If the UE is configured withpusch-AggregationFactor, and is configured with a second list (e.g., asingle-TB list that is not associated with multi-PUSCHs functionality),a repetition number/aggregation number “K” is equal to (and/or based on)pusch-AggregationFactor (e.g., the repetition number/aggregation number“K” is equal to and/or based on pusch-AggregationFactor for each entryof the second list).

Enhancements 5-7 comprises additions to Section 6.1.2.1 of 3GPP TS38.214 V16.3.0. An original portion of Section 6.1.2.1 of 3GPP TS 38.214V16.3.0, without any additions of Enhancement 5-7, is quoted in thefollowing quotation (some parts of the original portion are not includedin the quotation):

6.1.2 Resource Allocation 6.1.2.1 Resource Allocation in Time Domain

. . .For PUSCH repetition Type A, when transmitting PUSCH scheduled by DCIformat 0_1 or 0_2 in PDCCH with CRC scrambled with C-RNTI, MCS-C-RNTI,or CS-RNTI with NDI=1, the number of repetitions K is determined as

-   -   if numberOfRepetitions-r16 is present in the resource allocation        table, the number of repetitions K is equal to        numberOfRepetitions-r16;    -   elseif the UE is configured with pusch-AggregationFactor, the        number of repetitions K is equal to pusch-AggregationFactor;        -   otherwise K=1.

In Enhancement 5, addition 5 is made to the original portion of Section6.1.2.1 of 3GPP TS 38.214 V16.3.0 in accordance with some embodiments ofthe present disclosure. To distinguish addition 5 from what isoriginally included in the original portion of Section 6.1.2.1 of 3GPPTS 38.214 V16.3.0, addition 5 is in bold, and is preceded by the term“ADDITION 5 STARTS:” and followed by the term “ADDITION 5 ENDS”.

Enhancement 5:

6.1.2 Resource Allocation 6.1.2.1 Resource Allocation in Time Domain

. . .For PUSCH repetition Type A, when transmitting PUSCH scheduled by DCIformat 0_1 or 0_2 in PDCCH with CRC scrambled with C-RNTI, MCS-C-RNTI,or CS-RNTI with NDI=1, the number of repetitions K is determined as

-   -   if numberOfRepetitions-r16 is present in the resource allocation        table, the number of repetitions K is equal to        numberOfRepetitions-r16;    -   elseif the UE is configured with pusch-AggregationFactor        ADDITION 5 STARTS: and the DCI indicates row in        PUSCH-TimeDomainResourceAllocationList-r16, if any, in        pusch-Config which the row indicates resource allocation for one        PUSCH ADDITION 5 ENDS, the number of repetitions K is equal to        pusch-AggregationFactor;        -   otherwise K=1.

For example, Enhancement 5 provides that, if the UE is configured withpusch-AggregationFactor and a DCI (received by the UE, for example)indicates a row (e.g., an entry) inpusch-TimeDomainAllocationListForMultiPUSCH-r16 that indicates resourceallocation for one PUSCH (e.g., not more than one PUSCH), a number ofrepetitions K may be set to pusch-AggregationFactor.

In Enhancement 6, addition 6 is made to the original portion of Section6.1.2.1 of 3GPP TS 38.214 V16.3.0 in accordance with some embodiments ofthe present disclosure. To distinguish addition 6 from what isoriginally included in the original portion of Section 6.1.2.1 of 3GPPTS 38.214 V16.3.0, addition 6 is in bold, and is preceded by the term“ADDITION 6 STARTS:” and followed by the term “ADDITION 6 ENDS”.

Enhancement 6:

6.1.2 Resource Allocation 6.1.2.1 Resource Allocation in Time Domain

. . .For PUSCH repetition Type A, when transmitting PUSCH scheduled by DCIformat 0_1 or 0_2 in PDCCH with CRC scrambled with C-RNTI, MCS-C-RNTI,or CS-RNTI with NDI=1, the number of repetitions K is determined as

-   -   if numberOfRepetitions-r16 is present in the resource allocation        table, the number of repetitions K is equal to        numberOfRepetitions-r16;    -   elseif the UE is configured with pusch-AggregationFactor        ADDITION 5 STARTS: and the DCI schedules one PUSCH ADDITION 6        ENDS, the number of repetitions K is equal to        pusch-AggregationFactor;        -   otherwise K=1.

For example, Enhancement 6 provides that, if the UE is configured withpusch-AggregationFactor and a DCI (received by the UE, for example)schedules one PUSCH (e.g., not more than one PUSCH), a number ofrepetitions K may be set to pusch-AggregationFactor.

In Enhancement 7, addition 7 is made to the original portion of Section6.1.2.1 of 3GPP TS 38.214 V16.3.0 in accordance with some embodiments ofthe present disclosure. To distinguish addition 7 from what isoriginally included in the original portion of Section 6.1.2.1 of 3GPPTS 38.214 V16.3.0, addition 7 is in bold, and is preceded by the term“ADDITION 7 STARTS:” and followed by the term “ADDITION 7 ENDS”.

Enhancement 7:

6.1.2 Resource Allocation 6.1.2.1 Resource Allocation in Time Domain

. . .For PUSCH repetition Type A, when transmitting PUSCH scheduled by DCIformat 0_1 or 0_2 in PDCCH with CRC scrambled with C-RNTI, MCS-C-RNTI,or CS-RNTI with NDI=1, the number of repetitions K is determined as

-   -   if numberOfRepetitions-r16 is present in the resource allocation        table, the number of repetitions K is equal to        numberOfRepetitions-r16;    -   elseif the UE is configured with pusch-AggregationFactor and the        DCI schedules one PUSCH according to row in        PUSCH-TimeDomainResourceAllocationList-r16, if any, in        pusch-Config, the number of repetitions K is equal to        pusch-AggregationFactor;        -   otherwise K=1.

For example, Enhancement 7 provides that, if the UE is configured withpusch-AggregationFactor and a DCI (received by the UE, for example)schedules one PUSCH (e.g., not more than one PUSCH) according to a row(e.g., an entry) in pusch-TimeDomainAllocationListForMultiPUSCH-r16, anumber of repetitions K may be set to pusch-AggregationFactor.

Example Scenario 1

A UE receives a configuration from a network (e.g., the configuration isconfigured by the network) for configuring a list of time resourceallocations (e.g., the UE is configured with the list of time resourceallocations via the configuration). At least one entry in the listindicates multiple time resource allocations for multiple HARQ processnumbers. The UE receives a second configuration from the network (e.g.,the second configuration is configured by the network) for configuringan aggregation factor (e.g., the UE is configured with the aggregationfactor via the second configuration). The UE receives a DCI indicatingan entry (e.g., one entry) in the list. The entry indicates one or moretime resource allocations amounting to a number of time resourceallocations. The UE performs transmission or reception on one or moretime occasions. An association between each time occasion of the one ormore time occasions and a TB, a HARQ process number and/or a timeresource allocation is determined based on a pattern.

In some examples, a value of the aggregation factor is larger than one.

In some examples, a number of time resource allocations of the one ormore time resource allocations indicated by the entry is larger thanone.

In some examples, the UE operates with shared spectrum channel access ona carrier and/or a cell.

In some examples, a length of the pattern (e.g., a number of timeoccasions of the pattern) is equal to (and/or based on) the number oftime resource allocations of the one or more time resource allocationsindicated by the DCI.

In some examples, the length of the pattern is equal to (and/or basedon) the number of time resource allocations of the one or more timeresource allocations indicated by the DCI multiplied by the aggregationfactor (i.e., the length of the pattern is equal to and/or based on aproduct of the number of time resource allocations and the aggregationfactor).

In some examples, the length of the pattern is fixed, specified and/orconfigured (e.g., pre-configured) by the network.

In some examples, the pattern is that (and/or comprises) the one or moretime resource allocations indicated by the DCI are repeated sequentially(over the one or more time occasions, for example) until a number oftime occasions of the pattern is equal to the aggregation factor (suchas shown in FIG. 13 with respect to Option 4 in an example in which theone or more time resource allocations are SLIVs and the one or more timeoccasions are slots).

In some examples, the pattern is that (and/or comprises) an m-th timeresource allocation of the one or more time resource allocations isapplied on a set of time occasions comprising an m-th time occasion ofthe one or more time occasions, an n-th time occasion of the one or moretime occasions (wherein n is equal to m plus the number of time resourceallocations), . . . , an o-th time occasion of the one or more timeoccasions (wherein o is equal to m plus a product of the number of timeresource allocations and a number equal to the aggregation factor minus1, i.e., o is equal to m+the number of time resource allocations×(theaggregation factor−1)), wherein the set of time occasions are within thelength of the pattern.

In some examples, the pattern is that (and/or comprises) one or morefirst time resource allocations of the one or more time resourceallocations indicated by the DCI are repeated cyclically (over the oneor more time occasions, for example), such as shown in FIG. 13 withrespect to Option 2 in an example in which the one or more time resourceallocations are SLIVs and the one or more time occasions are slots.

In some examples, a second number of time resource allocations of theone or more first time resource allocations (of the one or more timeresource allocations) is determined based on a length of the patterndivided by the aggregation factor (e.g., with a floor operation, such aswhere a value equal to the length of the pattern divided by theaggregation factor is rounded down to a nearest integer if the value isnot an integer).

In some examples, the length of the pattern is larger than or equal tothe aggregation factor.

In some examples, the pattern is that (and/or comprises) an m-th timeresource allocation of the one or more first time resource allocations(of the one or more time resource allocations) is applied on a set oftime occasions comprising an m-th time occasion of the one or more timeoccasions, an n-th time occasion of the one or more time occasions(wherein n is equal to m plus a number, such as the second number oftime resource allocations), . . . , an o-th time occasion of the one ormore time occasions (wherein o is equal to m plus a product of i and anumber, such as the second number of time resource allocations), whereinthe set of time occasions are within the length of the pattern, andwherein i is a positive integer.

In some examples, the pattern is that (and/or comprises) a subset oftime resource allocations of the one or more time resource allocationsindicated by the DCI is repeated sequentially (such as shown in FIG. 13with respect to Option 3 and/or Option 5 in examples in which the one ormore time resource allocations are SLIVs and the one or more timeoccasions are slots), wherein a second number of time resourceallocations of the subset of time resource allocation is smaller than orequal to the number of time resource allocations of the one or more timeresource allocations.

In some examples, the subset of time resource allocations of the one ormore time resource allocations indicated by the DCI comprises a 1st timeresource allocation of the one or more time resource allocations, anm-th time resource allocation of the one or more time resourceallocations (wherein m is equal to 1 plus a product of i and theaggregation factor, i.e., m is equal to 1+i×the aggregation factor),wherein the subset of time resource allocations are applied to the oneor more time occasions within the length of the pattern, and wherein iis a positive integer.

In some examples, the length of the pattern is larger than or equal tothe aggregation factor.

In some examples, the pattern comprises a 1st time resource allocationof the one or more time resource allocations repeating from a 1st timeoccasion of the one or more time occasions to an m-th time occasion ofthe one or more time occasions (wherein m is equal to the aggregationfactor), and an n-th time resource allocation of the one or more timeresource allocations repeating from an n-th time occasion to a p-th timeoccasion (wherein n is equal to 1 plus a product of i and theaggregation factor (i.e., n is equal to 1+i×the aggregation factor), andp is equal to 1 plus a product of a number and the aggregation factor(i.e., p is equal to 1+the number×the aggregation factor), wherein thenumber is equal to i+1) and/or until the length of the pattern (e.g., imay be a positive integer).

In some examples, the pattern is that (and/or comprises) one timeresource allocation of the one or more time resource allocations isrepeated one or more times, wherein a number of times of the one or moretimes is equal to the aggregation factor.

In some examples, the pattern is that (and/or comprises) each timeresource allocation of the one or more time resource allocations isrepeated one or more times sequentially, wherein a number of times ofthe one or more times is equal to the aggregation factor.

In some examples, the pattern is that (and/or comprises) an m-th timeresource allocation corresponds to a set of time occasions from an n-thtime occasion of the one or more time occasions (wherein n is equal to 1plus a product of the aggregation factor and a number, i.e., n is equalto 1+the aggregation factor×the number, wherein the number is equal to mminus 1) to an o-th time occasion (wherein o is equal to 1 plus aproduct of the aggregation factor and m, i.e., o is equal to 1+theaggregation factor×m), wherein the set of time occasions are within thelength of the pattern.

In some examples, the pattern is that (and/or comprises) one or morefirst time resource allocations of the one or more time resourceallocations indicated by the DCI are repeated sequentially.

In some examples, a second number of time resource allocations of theone or more first time resource allocations (of the one or more timeresource allocations) is determined based on a length of the patterndivided by the aggregation factor (e.g., with a floor operation, such aswhere a value equal to the length of the pattern divided by theaggregation factor is rounded down to a nearest integer if the value isnot an integer).

In some examples, the length of the pattern is larger than or equal tothe aggregation factor.

In some examples, the pattern is that (and/or comprises) an m-th timeresource allocation of the one or more first time resource allocations(of the one or more time resource allocations) is applied on a set oftime occasions from an n-th time occasion of the one or more timeoccasions (wherein n is equal to 1 plus a product of the aggregationfactor and a number, i.e., n is equal to 1+the aggregation factor×thenumber, wherein the number is equal to m minus 1) to a p-th timeoccasion of the one or more time occasions (wherein p is equal to 1 plusa product of the aggregation factor and m, i.e., p is equal to 1+theaggregation factor×m), wherein the set of time occasions are within thelength of the pattern.

Example Scenario 2

In some examples, a UE receives a first information (e.g., aconfiguration and/or a signal) from a network to configure one or moredifferent time resource allocations for transmission or reception ofdifferent data (e.g., different sets of data, such as different TBs).

Alternatively and/or additionally, the UE may receive a secondinformation (e.g., a configuration and/or a signal) from the network toconfigure a repetition number (e.g. aggregation factor) used forrepeatedly transmitting or receiving the same data (e.g. repeatedlytransmitting at least one of the same TB, the same MAC PDU, etc.),wherein the same data may be repeatedly transmitted with the sameredundancy version or with different redundancy versions.

Alternatively and/or additionally, the UE may receive a DCI from thenetwork indicating a first HARQ process (e.g., a specific HARQ process)for data transmission or reception and indicating information associatedwith one or more time resource allocations (and/or associated with afirst number of time resource allocations of the one or more timeresource allocations).

Alternatively and/or additionally, the UE may transmit or receivedifferent sets of data comprising a set of data “data 1” to a set ofdata “data X” (e.g., data 1, data 2, . . . , data X), repeatedly withthe repetition number by using the first HARQ process and one or moreother HARQ processes on the one or more time resource allocations.

In some examples, the UE transmits or receives the different sets ofdata via a data pattern comprising [data 1, data 1, . . . , data 2, data2, . . . , data X−1, data X−1, . . . , data X, data X, . . . ] or [data1, data 2, . . . , data X, data 1, data 2, . . . , data X, data 1, data2, . . . , data X, . . . ].

In some examples, the repetition number is K, an ID of the first HARQprocess is N and one or more IDs of the one or more other HARQ processesused for the data pattern are values shown in Example 1, Example 2, andExample 3 below (e.g., the values shown below may be determined using amodulo operation with a third number, such as a number of HARQ processnumbers supported and/or used by the UE and/or a number of HARQ processnumbers that the UE is configured with):

Example 1: [N, N, . . . , N, N+1, N+1, . . . , N+1, N+2, N+2, . . . ]

Example 2: [N, N, . . . , N, N+K, N+K, . . . , N+K, N+2K, N+2K, . . . ]

Example 3: [N, N+1, N+2, . . . , N+X, N, N+1, N+2, . . . ].

In some examples, the first information and the second information arecarried in the same message.

In some examples, the one or more time resource allocations are used forrepeating data transmission or reception indicated by the DCI if a totalnumber of data transmissions or receptions is larger than or equal tothe first number of time resource allocations.

Example Scenario 3

A network transmits a first signal to a UE for configuring a list oftime resource allocations. At least one entry in the list indicatesmultiple time resource allocations for multiple TBs and/or multiple HARQprocess numbers. The network transmits a second signal to the UE forconfiguring an aggregation factor. The network is not configured toconfigure (e.g., is not allowed to configure, is prevented fromconfiguring and/or is prohibited from configuring) the aggregationfactor. Alternatively and/or additionally, the network may not beconfigured to configure (e.g., is not allowed to configure, is preventedfrom configuring and/or is prohibited from configuring) the aggregationfactor to be larger than one. The network transmits a DCI, to the UE,indicative of an entry (e.g., one entry) in the list, wherein the entryindicates one or more time resource allocations. The network performsreception or transmission on one or more time occasions. A number oftime occasions of the one or more time occasions is equal to (and/orbased on) a number of time resource allocations of the one or more timeresource allocations.

Example Scenario 4

A UE receives a first configuration, from a network, for configuring alist of time resource allocations. At least one entry in the listindicates multiple time resource allocations for multiple TBs and/ormultiple HARQ process numbers. The UE receives a second configuration,from the network (or from a second network), for configuring anaggregation factor. The UE does not expect to be configured with theaggregation factor. Alternatively and/or additionally, the UE may notexpect to be configured with the aggregation factor being larger thanone. The UE receives a DCI indicating an entry (e.g., one entry) in thelist, wherein the entry indicates one or more time resource allocations.The UE performs transmission or reception on one or more time occasions.A number of time occasions of the one or more time occasions is equal to(and/or based on) a number of time resource allocations of the one ormore time resource allocations.

With respect to Example Scenario 3 and Example Scenario 4, in someexamples, the network and/or the UE operate with shared spectrum channelaccess on a carrier and/or a cell.

In some examples, the first signal and the second signal are carried inthe same message (e.g., the same message, transmitted to the UE,comprises the first signal and the second signal).

In some examples, each TB of the multiple TBs is transmitted orreceived, by the UE, at least once (via the one or more time occasions,for example).

In some examples, each TB of the multiple TBs is transmitted orreceived, by the UE, merely once (via the one or more time occasions,for example).

In some examples, TBs of the multiple TBs (e.g., some and/or all TBs ofthe multiple TBs) are transmitted or received by the UE in consecutiveslots in time domain.

In some examples, each TB of the multiple TBs is associated with a timeresource allocation of the one or more time resource allocations. Forexample, each TB of the multiple TBs may be associated with a differenttime resource allocation of the one or more time resource allocations.For example, each TB of the multiple TBs is associated with a timeresource allocation, of the one or more time resource allocations, thatis different from other time resource allocations (of the one or moretime resource allocations) associated with other TBs of the multipleTBs. For example, at least one of a first TB of the multiple TBs may beassociated with a first time resource allocation of the one or more timeresource allocations, a second TB of the multiple TBs may be associatedwith a second time resource allocation of the one or more time resourceallocations (wherein the second time resource allocation is differentfrom the first time resource allocation), etc.

Example Scenario 5

A UE receives a configuration from a network (e.g., the configuration isconfigured by the network) for configuring a list of time resourceallocations (e.g., the UE is configured with the list of time resourceallocations via the configuration). At least one entry in the listindicates multiple time resource allocations for multiple TBs and/ormultiple HARQ process numbers. The UE receives a second configurationfrom the network (e.g., the second configuration is configured by thenetwork) for configuring an aggregation factor (e.g., the UE isconfigured with the aggregation factor via the second configuration).The UE receives a DCI indicating an entry (e.g., one entry) in the list.The entry indicates one or more time resource allocations amounting to anumber of time resource allocations. The UE determines a repetitionnumber based on the aggregation factor and the number of time resourceallocations (and/or based on other information in addition to theaggregation factor and the number of time resource allocations).

In some examples, if the number of time resource allocations is a firstdefined number, the repetition number is according to the aggregationfactor (e.g., the repetition number is equal to and/or based on theaggregation factor).

In some examples, the first defined number is one.

In some examples, if the number of time resource allocations is not thefirst defined number, the repetition number is 1 and/or is not based onthe aggregation factor.

In some examples, the repetition number corresponds to a number of timesthe UE transmits data (e.g., a TB) in response to the DCI.

In some examples, the UE transmits multiple TBs based on the one or moretime resource allocations indicated by the entry.

In some examples, each TB of the multiple TBs is associated with a timeresource allocation of the one or more time resource allocations. Forexample, each TB of the multiple TBs may be associated with a differenttime resource allocation of the one or more time resource allocations.For example, each TB of the multiple TBs is associated with a timeresource allocation, of the one or more time resource allocations, thatis different from other time resource allocations (of the one or moretime resource allocations) associated with other TBs of the multipleTBs. For example, at least one of a first TB of the multiple TBs may beassociated with a first time resource allocation of the one or more timeresource allocations, a second TB of the multiple TBs may be associatedwith a second time resource allocation of the one or more time resourceallocations (wherein the second time resource allocation is differentfrom the first time resource allocation), etc.

In some examples, either the UE transmits a single TB multiple times orthe UE transmits multiple TBs (e.g., multiple different TBs), wherein anumber of TBs of the multiple TBs is based on the number of timeresource allocations.

In some examples, if the number of time resource allocations is a firstdefined number, the UE transmits a single TB multiple times based on theaggregation factor (e.g., the UE may transmit the single TB multipletimes based on the DCI).

In some examples, the first defined number is one.

In some examples, if the number of time resource allocations is not thefirst defined number, the UE transmits multiple TBs (e.g., multipledifferent TBs), wherein a number of TBs of the multiple TBs is based onthe number of time resource allocations (e.g., the UE may transmit themultiple TBs based on the DCI).

In some examples, the multiple TBs are associated with the multiple timeresource allocations, respectively. For example, at least one of a firstTB of the multiple TBs may be associated with a first time resourceallocation of the multiple time resource allocations (e.g., the first TBmay be transmitted via the first time resource allocation), a second TBof the multiple TBs may be associated with a second time resourceallocation of the multiple time resource allocations (e.g., the secondTB may be transmitted via the second time resource allocation), etc.

In some examples, in response to the DCI and/or the one or more timeresource allocations indicated by the entry (and/or based on the DCIand/or the one or more time resource allocations indicated by theentry), the UE either transmits (or receives) a single TB multiple timesor the UE transmits multiple TBs.

In some examples, the UE transmits or receives a single TB multipletimes when the number of time resource allocations is a first definednumber, wherein a number of times of the multiple times (that the singleTB is transmitted or received) is equal to (and/or based on) theaggregation factor.

In some examples, the first defined number is one.

In some examples, the UE transmits multiple TBs when the number of timeresource allocations is not the first defined number, wherein a numberof TBs of the multiple TBs is equal to the number of time resourceallocations.

In some examples, the UE performs transmission or reception on one ormore time occasions.

In some examples, a number of time occasions of the one or more timeoccasions is equal to (and/or based on) the aggregation factor if thenumber of time resource allocations (of the one or more time resourceallocations indicated by the entry) is a first defined number.

In some examples, the first defined number is one.

In some examples, if the number of time resource allocations indicatedby the entry is not the first defined number, the number of timeoccasions of the one or more time occasions is not equal to (and/or isnot based on) the aggregation factor.

In some examples, if the number of time resource allocations indicatedby the entry is not the first defined number, the number of timeoccasions the one or more time occasions is equal to (and/or based on)the number of aggregation factor.

In some examples, the UE performs transmission or reception on one ormore time occasions, wherein a number of time occasions of the one ormore time occasions is determined based on either the number of timeresource allocations or the aggregation factor

In some examples, when the number of time resource allocations indicatedby the entry is a first defined number, the number of time occasions isequal to (and/or based on) the aggregation factor.

In some examples, the first defined number is one.

In some examples, when the number of time resource allocations indicatedby the entry is not the first defined number, the number of timeoccasions is equal to (and/or based on) the number of time resourceallocations.

In some examples, the UE performs transmission or reception on one ormore time occasions, wherein whether the one or more time occasions areassociated with a single HARQ process number or are associated withmultiple HARQ process numbers is based on the number of time resourceallocations.

In some examples, the one or more time occasions are associated with thenumber of time resource allocations and/or the aggregation factor.

In some examples, the one or more time occasions are associated with asingle HARQ process number (e.g., each time occasion of the one or moretime occasions corresponds to the single HARQ process number), differenttime occasions (of the one or more time occasions, for example) areassociated with a single TB (e.g., each time occasion of the differenttime occasions corresponds to the same TB), and/or a number of timeoccasions of the one or more time occasions is equal to (and/or basedon) the aggregation factor.

In some examples, when the number of time resource allocations is afirst defined number, the one or more time occasions are associated witha single HARQ process number (e.g., each time occasion of the one ormore time occasions corresponds to the single HARQ process number),different time occasions (of the one or more time occasions, forexample) are associated with a single TB (e.g., each time occasion ofthe different time occasions corresponds to the same TB), and/or thenumber of time occasions of the one or more time occasions is equal to(and/or based on) the aggregation factor

In some examples, the one or more time occasions are associated withmultiple HARQ process numbers, different time occasions (of the one ormore time occasions, for example) are associated with multiple TBs(e.g., the different time occasions are associated with different TBs,such as where a first time occasion of the different time occasions isassociated with a first TB and a second time occasion of the differenttime occasions is associated with a second TB), and/or a number of timeoccasions of the one or more time occasions is equal to (and/or basedon) the number of time resource allocations.

In some examples, when the number of time resource allocations is notthe first defined number, the one or more time occasions are associatedwith multiple HARQ process numbers, different time occasions (of the oneor more time occasions, for example) are associated with multiple TBs(e.g., the different time occasions are associated with different TBs,such as where a first time occasion of the different time occasions isassociated with a first TB and a second time occasion of the differenttime occasions is associated with a second TB), and/or a number of timeoccasions of the one or more time occasions is equal to (and/or basedon) the number of time resource allocations.

In some examples, the first defined number is one.

In some examples, the number of time resource allocations not being thefirst defined number implies that the number of time resourceallocations is larger than the first defined number.

In some examples, the first defined number is equal to a number (e.g.,an integer) divided by the number of time resource allocations (of theone or more time resource allocations). In some examples, the firstdefined number is an integer (e.g., the number may be divided by thenumber of time resource allocations with a ceiling operation or a flooroperation to determine the first defined number without a remainder).Alternatively and/or additionally, the first defined number may comprisea set of defined numbers (wherein each defined number of the set ofdefined numbers is an integer, for example).

In some examples, the UE performs retransmission on one or more timeoccasions, wherein whether the one or more time occasions are associatedwith a single HARQ process number or are associated with multiple HARQprocess numbers is based on a number of time resource allocations of theone or more time resource allocations.

In some examples, the one or more time occasions are associated with thefirst HARQ process number (e.g., each time occasion of the one or moretime occasions corresponds to the first HARQ process number). Forexample, the one or more time occasions are associated with the firstHARQ process number when the number of time resource allocations is one(e.g., each time occasion of the one or more time occasions correspondsto the first HARQ process number when the number of time resourceallocations is one).

In some examples, the one or more time occasions are associated withmultiple HARQ process numbers, wherein the multiple HARQ process numberscomprise the first HARQ process number (e.g., at least one time occasionof the one or more time occasions corresponds to the first HARQ processnumber). For example, when the number of time resource allocations isone, the one or more time occasions are associated with multiple HARQprocess numbers, wherein the multiple HARQ process numbers comprise thefirst HARQ process number (e.g., at least one time occasion of the oneor more time occasions corresponds to the first HARQ process number).

In some examples, the one or more time occasions are associated withmultiple HARQ process numbers, wherein the multiple HARQ process numberscomprise the second HARQ process number (e.g., at least one timeoccasion of the one or more time occasions corresponds to the secondHARQ process number). For example, when the number of time resourceallocations is one, the one or more time occasions are associated withmultiple HARQ process numbers, wherein the multiple HARQ process numberscomprise the second HARQ process number (e.g., at least one timeoccasion of the one or more time occasions corresponds to the secondHARQ process number).

One, some and/or all of the foregoing techniques and/or embodiments canbe formed to a new embodiment.

In some examples, embodiments disclosed herein, such as embodimentsdescribed with respect to the first concept, the second concept, thethird concept, Example Scenario 1, Example Scenario 2, Example Scenario3, Example Scenario 4 and Example Scenario 5, may be implementedindependently and/or separately. Alternatively and/or additionally, acombination of embodiments described herein, such as embodimentsdescribed with respect to the first concept, the second concept, thethird concept, Example Scenario 1, Example Scenario 2, Example Scenario3, Example Scenario 4 and/or Example Scenario 5, may be implemented.Alternatively and/or additionally, a combination of embodimentsdescribed herein, such as embodiments described with respect to thefirst concept, the second concept, the third concept, Example Scenario1, Example Scenario 2, Example Scenario 3, Example Scenario 4 and/orExample Scenario 5, may be implemented concurrently and/orsimultaneously.

Various techniques, embodiments, methods and/or alternatives of thepresent disclosure may be performed independently and/or separately fromone another. Alternatively and/or additionally, various techniques,embodiments, methods and/or alternatives of the present disclosure maybe combined and/or implemented using a single system. Alternativelyand/or additionally, various techniques, embodiments, methods and/oralternatives of the present disclosure may be implemented concurrentlyand/or simultaneously.

With respect to one or more embodiments herein, such as one or moretechniques, devices, concepts, methods, example scenarios and/oralternatives described above, in some examples, the UE receives the DCIin slot n, and/or the DCI indicates a slot offset.

With respect to one or more embodiments herein, in some examples, theslot offset may indicate a slot for an initial scheduled time occasionassociated with a first time resource allocation among the one or moretime resource allocations (e.g., multiple time resource allocations)indicated by the DCI (e.g., the DCI is indicative of the entry, of thelist, comprising the one or more time resource allocations), if thenumber of time resource allocation is larger than one.

With respect to one or more embodiments herein, in some examples, theslot offset may indicate a slot for the initial scheduled time occasionassociated with a single time resource allocation indicated by the DCI,if the number of time resource allocations is one (e.g., if the one ormore time resource allocations merely comprise the single time resourceallocation).

With respect to one or more embodiments herein, in some examples, a timeresource allocation (e.g., one time resource allocation) corresponds toa starting OFDM symbol, a length of OFDM symbols (e.g., a length ofconsecutive OFDM symbols), and/or a mapping type. In an example, thelength of OFDM symbols may be a number of one or more OFDM symbolscorresponding to the time resource allocation.

With respect to one or more embodiments herein, in some examples, a timeoccasion may be a slot, a mini-slot, a resource associated with a timeresource allocation (e.g., one time resource allocation), a PUSCH or aPDSCH.

With respect to one or more embodiments herein, in some examples, a timeresource allocation (e.g., one time resource allocation) corresponds toa SLIV index/number (e.g., one SLIV index/number, such as a SLIV indexcorresponding to a SLIV and/or a SLIV number corresponding to the SLIV).

With respect to one or more embodiments herein, in some examples, a timeresource allocation (e.g., one time resource allocation) indicates oneor more symbols (e.g., one or more consecutive symbols) in a slot.

With respect to one or more embodiments herein, in some examples, a timeresource allocation (e.g., one time resource allocation) is indicated(e.g., represented) by a number of bits of a field (e.g.,startSymbolAndLength or startSymbolAndLength-r16).

With respect to one or more embodiments herein, in some examples, thereare 105 time resource allocations (e.g., 105 candidate time resourceallocations) within a slot.

With respect to one or more embodiments herein, in some examples, thenumber of bits is 7.

With respect to one or more embodiments herein, in some examples, thelist of time resource allocations is used for indicating time resourceallocation for uplink or downlink transmission.

With respect to one or more embodiments herein, in some examples, eachentry in the list of time resource allocation indicates (e.g.,comprises) up to a maximum number of time resource allocations. In anexample, the maximum number of time resource allocations is 8.

With respect to one or more embodiments herein, in some examples, theDCI indicates a first HARQ process number (e.g., a specific HARQ processnumber).

With respect to one or more embodiments herein, in some examples, thefirst HARQ process number corresponds to one or more time occasionscomprising an initial time occasion (e.g., an initial time occasion ofone or more time occasions scheduled by the DCI) in time domain.

With respect to one or more embodiments herein, in some examples, theinitial time occasion corresponds to a time resource allocationindicated by the entry (e.g., the one entry), such as an initial timeresource allocation indicated by the entry.

With respect to one or more embodiments herein, in some examples, anm-th time resource allocation of the one or more time resourceallocations indicated by the DCI corresponds to a HARQ process numberequal to the first HARQ process number+m−1.

With respect to one or more embodiments herein, in some examples, one ormore operations (e.g., at least one of an addition operation, asubtraction operation, etc.) associated with determining a HARQ processnumber may be applied with modulo operation of g. For example, inexamples in which a HARQ process number is described as being equal to anumber, the HARQ process number may be equal to the number modulo g. Forexample, if a HARQ process number is described herein as being equal tothe first HARQ process number+m−1, the HARQ process number may be equalto (the first HARQ process number+m−1) modulo g. In an example in whichthe first HARQ process number=15, m=3 and g=16, the HARQ process number(described herein as being equal to the first HARQ process number+m−1)may be determined using a modulo operation and may be equal to (15+3−1)modulo 16=1.

With respect to one or more embodiments herein, in some examples, gcorresponds to a number of HARQ processes, such as a total number ofHARQ processes supported and/or used by the UE and/or a total number ofHARQ processes that the UE is configured with (e.g., a number of HARQprocesses that the UE can process, and/or a number of HARQ processesthat the UE can simultaneously process). In an example, g corresponds toa number of HARQ process numbers, such as a total number of HARQ processnumbers supported and/or used by the UE and/or a total number of HARQprocess numbers that the UE is configured with (e.g., a number of HARQprocess numbers that the UE can process, and/or a number of HARQ processnumbers that the UE can simultaneously process).

With respect to one or more embodiments herein, in some examples, g(e.g., the number of HARQ processes and/or the number of HARQ processnumbers) is equal to 16.

With respect to one or more embodiments herein, in some examples, theaggregation factor is associated with (e.g., used for) consecutivetransmissions, consecutive time occasions and/or consecutive slots fortransmitting a single TB. For example, the aggregation factor may beassociated with (e.g., used for) configuring a number of consecutivetransmissions of the consecutive transmissions (to be used fortransmitting the single TB, for example), a number of consecutive timeoccasions of the consecutive time occasions (to be used for transmittingthe single TB, for example) and/or a number of consecutive slots of theconsecutive slots (to be used for transmitting the single TB, forexample).

With respect to one or more embodiments herein, in some examples, theaggregation factor is associated with (e.g., used for) slot aggregationand/or transmission aggregation for a single TB.

With respect to one or more embodiments herein, in some examples, theaggregation factor is used for downlink transmission or uplinktransmission.

With respect to one or more embodiments herein, in some examples, avalue of the aggregation factor is a number (e.g., an integer) largerthan 1. In an example, the aggregation factor is equal to 2^(r), whereinr is an integer larger than 0 (e.g., the aggregation factor may be oneof 2, 4, 8, etc.).

With respect to one or more embodiments herein, in some examples, theaggregation factor is updated based on Radio Resource Control (RRC)signaling.

With respect to one or more embodiments herein, in some examples, anentry of the list (e.g., each entry in the list) does not comprise aparameter for configuring the aggregation factor.

With respect to one or more embodiments herein, in some examples, eachentry of the list does not indicate the aggregation factor.

With respect to one or more embodiments herein, in some examples, if anentry of the list comprises one or more parameters for configuring theaggregation factor and/or if the aggregation factor is indicated by oneor more entries in the list, the network is limited (e.g., restricted)to configuring the aggregation factor to be one.

With respect to one or more embodiments herein, in some examples, if anentry of the list comprises one or more parameters for configuring theaggregation factor and/or if the aggregation factor is indicated by oneor more entries in the list, the network does not configure theaggregation factor (for the UE, for example).

With respect to one or more embodiments herein, in some examples, if anentry of the list comprises one or more parameters for configuring theaggregation factor and/or if the aggregation factor is indicated by oneor more entries in the list, the network may make one or more parameters(associated with the aggregation factor, for example) absent (e.g., thenetwork may not include the one or more parameters in a configurationfor the UE).

With respect to one or more embodiments herein, in some examples, afterthe aggregation factor is configured (e.g., upon and/or in response tothe aggregation factor being configured) a number of repetitions of asingle TB and/or a number of repetitions of a single time resourceallocation do not change (e.g., cannot be changed) based on a differententry indicated by the DCI, wherein the number of time resourceallocations of the one or more time resource allocations indicated bythe DCI may be 1.

With respect to one or more embodiments herein, in some examples, theinitial time occasion (e.g., an initial time occasion of one or moretime occasions scheduled by the DCI) corresponds to (e.g., comprisesand/or is within) slot n+the slot offset (e.g., the slot offset may be“k2”).

With respect to one or more embodiments herein, in some examples, theone or more time occasions correspond to (e.g., comprise and/or arewithin) slots comprising slot n+the slot offset, slot n+the slotoffset+1, . . . , slot n+the slot offset+the aggregation factor−1 (e.g.,the one or more time occasions may correspond to consecutive slots fromslot n+the slot offset to slot n+the slot offset+the aggregationfactor−1).

With respect to one or more embodiments herein, in some examples, theone or more time occasions correspond to (e.g., comprise and/or arewithin) slot n+the slot offset, slot n+the slot offset+1, . . . , slotn+the slot offset+the number of time resource allocations−1 (e.g., thenumber of time resource allocations is the number of time resourceallocations of the one or more time resource allocations indicated bythe DCI). For example, the one or more time occasions may correspond toconsecutive slots from slot n+the slot offset to slot n+the slotoffset+the number of time resource allocations−1.

With respect to one or more embodiments herein, in some examples, theDCI is scrambled by Cell Radio Network Temporary Identifier (C-RNTI) ofthe UE.

With respect to one or more embodiments herein, in some examples, theDCI indicates one or more new transmissions of one or more TBs. A newtransmission may be an initial transmission of data and/or atransmission of data that is not a retransmission of data.

With respect to one or more embodiments herein, in some examples, theDCI indicates one or more transmissions of one or more TBs, wherein theone or more transmissions of the one or more TBs may be one or more newtransmissions of the one or more TBs or one or more retransmissions ofthe one or more TBs. In an example, the DCI indicates four SLIVs (e.g.,the DCI is indicative of an entry indicative of four SLIVs), and a firstHARQ process number (e.g., a specific HARQ process) equal to 3. In theexample, HARQ process numbers {3, 4, 5, 6} may be associated with thefour SLIVs, respectively. In some examples, whether the one or moretransmissions are one or more new transmissions or the one or moretransmissions are one or more retransmissions is determined based on oneor more New Data Indicator (NDI) values. A number of NDI values of theone or more NDI values may be equal to (and/or based on) the number ofSLIVs (e.g., the number of NDI values may be four based on the number ofSLIVs being four). The one or more NDI values are associated with HARQprocess numbers {3, 4, 5, 6}, respectively. For example, each NDI valueof the one or more NDI values may be associated with a HARQ processnumber of the HARQ process numbers {3, 4, 5, 6} (e.g., the NDI value mayindicate whether the HARQ process number associated with the NDI valueis for a new transmission or the HARQ process number is for aretransmission).

With respect to one or more embodiments herein, in some examples,regarding one or more entries (e.g., entry 5) in the list 600 of FIG. 6,the network may configure SLIVs from 0 to 105. For example, although thefour SLIVs in entry 5 in the list 600 are shown as being contiguous witheach other in FIG. 6 (e.g., the four SLIVs in entry 5 comprise {70, 71,72, 73}), SLIVs of entry 5 are not limited to being contiguous SLIVs.

With respect to one or more embodiments herein, in some examples, for anuplink transmission in unlicensed spectrum, the uplink transmission maycomprise (e.g., deliver and/or carry) an Uplink Control Information(UCI).

With respect to one or more embodiments herein, in some examples, theUCI indicates an NDI, a HARQ process number and/or a Redundancy Version(RV) index associated with the uplink transmission.

With respect to one or more embodiments herein, in some examples, thenetwork indicates a part of an occupancy time to one or more UEs suchthat the one or more UEs perform uplink transmission during the part ofthe occupancy time.

With respect to one or more embodiments herein, in some examples, aBandwidth Part (BWP) on the carrier comprises one or more consecutiveLBT bandwidths on the carrier.

With respect to one or more embodiments herein, in some examples, an LBTbandwidth (e.g., one LBT bandwidth) is 20 MHz.

Throughout the present disclosure, if a first number is equal to asecond number, this may imply that the first number is the same as thesecond number. For example, if a number of time resource allocations isequal to a defined number, the number of time resource allocations maybe the same as the defined number.

Throughout the present disclosure, if a first number is a second number,this may imply that the first number is equal to the second number. Forexample, if a number of time resource allocations is a defined number,the number of time resource allocations may be equal to the definednumber.

Throughout the present disclosure, one, some and/or all instances of“equal” may be replaced with “equivalent”.

FIG. 18 is a flow chart 1800 according to one exemplary embodiment fromthe perspective of a UE. In step 1805, the UE receives a firstconfiguration, from a network, for configuring a list associated withtime resource allocation, wherein at least one entry in the listindicates multiple time resource allocations for multiple TBs and/or formultiple HARQ process numbers. For example, the UE may be configuredwith the list via the first configuration (e.g., the first configurationmay be indicative of the list). Alternatively and/or additionally, thefirst configuration may be configured by the network. In step 1810, theUE receives a second configuration from the network (and/or a secondnetwork), wherein the second configuration is associated withconfiguring an aggregation factor (e.g., the second configuration is forconfiguring the aggregation factor). For example, the secondconfiguration may comprise an indication of the aggregation factor. Instep 1815, the UE receives a DCI indicating an entry (e.g., one entry)in the list, wherein the entry indicates one or more time resourceallocations. In step 1820, in response to the DCI (and/or in response tothe one or more time resource allocations indicated by the entry), theUE one of: (a) transmits or receives a single TB multiple times, or (b)transmits multiple TBs.

In one embodiment, the UE transmits or receives the single TB multipletimes when a number of time resource allocations of the one or more timeresource allocations is a defined number (e.g., a specific number),wherein a number of times the single TB is transmitted is based on(e.g., equal to) the aggregation factor. For example, the UE maytransmit or receive the single TB multiple times in response to the DCIbased on a determination that the number of time resource allocations isthe defined number.

In one embodiment, the UE transmits the multiple TBs when the number oftime resource allocations is not the defined number, wherein a number ofTBs of the multiple TBs is based on (e.g., equal to) the number of timeresource allocations. For example, the UE may transmit the multiple TBsin response to the DCI based on a determination that the number of timeresource allocations is not the defined number.

In one embodiment, the defined number is one.

Referring back to FIGS. 3 and 4, in one exemplary embodiment of a UE,the device 300 includes a program code 312 stored in the memory 310. TheCPU 308 may execute program code 312 to enable the UE (i) to receive afirst configuration, from a network, for configuring a list associatedwith time resource allocation, wherein at least one entry in the listindicates multiple time resource allocations for multiple TBs and/or formultiple HARQ process numbers, (ii) to receive a second configurationfrom the network (and/or a second network), wherein the secondconfiguration is associated with configuring an aggregation factor(e.g., the second configuration is for configuring the aggregationfactor), (iii) to receive a DCI indicating an entry (e.g., one entry) inthe list, wherein the entry indicates one or more time resourceallocations, and (iv) in response to the DCI (and/or in response to theone or more time resource allocations indicated by the entry), to oneof: (a) transmit or receive a single TB multiple times, or (b) transmitmultiple TBs. Furthermore, the CPU 308 can execute the program code 312to perform one, some and/or all of the above-described actions and stepsand/or others described herein.

FIG. 19 is a flow chart 1900 according to one exemplary embodiment fromthe perspective of a UE. In step 1905, the UE receives a messageassociated with PUSCH parameter configuration (e.g., the message is forconfiguring one or more PUSCH parameters). The message comprises a firstparameter (e.g., a PUSCH parameter). The first parameter indicates(e.g., configures) a list of entries associated with time resourceallocation for multiple PUSCHs. In an example, the UE may be configuredwith the list of entries using the first parameter. The list of entriesdoes not comprise a third parameter for configuring a number ofrepetitions (e.g., a plurality of time resource allocations of one ormore entries of the list of entries does not comprise a parameter forconfiguring a number of repetitions and/or each time resource allocationof the plurality of time resource allocations does not comprise aparameter for configuring a number of repetitions). The UE does notexpect the message to comprise a second parameter that configures and/orindicates an aggregation factor. The message may not comprise the secondparameter that configures and/or indicates the aggregation factor. Instep 1910, the UE receives a DCI indicative of a first entry in thelist, wherein the first entry is indicative of one or more time resourceallocations. In step 1915, the UE performs one or more transmissions onone or more time occasions, wherein a number of time occasions of theone or more time occasions is based on a number of time resourceallocations of the one or more time resource allocations. In an example,the number of time occasions is equal to the number of time resourceallocations.

In one embodiment, the UE operates with shared spectrum channel accesson a carrier and/or a cell. For example, the UE operates with sharedspectrum channel access on the carrier and/or the cell during a periodof time in which the UE receives the message, receives the DCI, and/orperforms the one or more transmissions.

In one embodiment, the message is a RRC message.

In one embodiment, the message is PUSCH-Config (e.g., PUSCH-Configinformation element).

In one embodiment, for each TB of a plurality of TBs, the one or moretransmissions comprise a transmission of the TB. For example, each TB ofthe plurality of TBs is transmitted at least one time via the one ormore transmissions. Alternatively and/or additionally, each TB of theplurality of TBs is transmitted merely one time via the one or moretransmissions.

In one embodiment, the one or more transmissions comprise transmittingTBs of the plurality of TBs (e.g., all TBs of the plurality of TBs) inconsecutive slots in time domain (e.g., slots that are contiguous witheach other).

In one embodiment, each TB of the plurality of TBs is associated with atime resource allocation of the one or more time resource allocations.For example, the one or more time resource allocations may comprisemultiple time resource allocations, wherein TBs of the plurality of TBs(e.g., all TBs of the plurality of TBs) are associated with timeresource allocations of the multiple time resource allocations,respectively (e.g., each TB of the plurality of TBs is associated witheach time resource allocation of the multiple time resource allocations,respectively). In an example, each TB of the plurality of TBs may beassociated with a different time resource allocation of the multipletime resource allocations. For example, each TB of the plurality of TBsis associated with a time resource allocation, of the multiple timeresource allocations, that is different from other time resourceallocations (of the multiple time resource allocations) associated withother TBs of the plurality of TBs. For example, at least one of a firstTB of the plurality of TBs may be associated with a first time resourceallocation of the multiple time resource allocations, a second TB of theplurality of TBs may be associated with a second time resourceallocation of the multiple time resource allocations (wherein the secondtime resource allocation is different from the first time resourceallocation), etc.

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations corresponds toa starting OFDM symbol, a length of consecutive OFDM symbols and/or amapping type.

In one embodiment, a time occasion of the one or more time occasions(and/or each time occasion of the one or more time occasions) is a slot,a mini-slot, a resource associated with a time resource allocation(e.g., one time resource allocation) of the one or more time resourceallocations, and/or a PUSCH.

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations corresponds toa SLIV. For example, the time resource allocation may correspond to aSLIV index/number (e.g., one SLIV index/number, such as a SLIV indexcorresponding to the SLIV and/or a SLIV number corresponding to theSLIV).

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations corresponds toa SLIV and a mapping type.

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations indicates oneor more symbols (e.g., one or more consecutive symbols) in a slot (e.g.,a transmission of the one or more transmissions may be performed via theone or more symbols based on the time resource allocation).

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations is configuredby a PUSCH-Allocation-r16 (e.g., one PUSCH-Allocation-r16).

In one embodiment, the list is associated with time resource allocationfor uplink transmission. For example, the list may be used forindicating time resource allocations for uplink transmission.

In one embodiment, each entry in the list indicates (e.g., comprises) atmost a threshold number of time resource allocations. In an example, thethreshold number of time resource allocations is eight.

In one embodiment, time resource allocations of the one or more timeresource allocations (e.g., all time resource allocations of the one ormore time resource allocations) correspond to different starting OFDMsymbols, different lengths of consecutive OFDM symbols and/or differentmapping types. For example, the one or more time resource allocationsmay comprise multiple time resource allocations, wherein time resourceallocations of the multiple time resource allocations (e.g., all timeresource allocations of the multiple time resource allocations)correspond to different starting OFDM symbols, different lengths ofconsecutive OFDM symbols and/or different mapping types. In an example,each time resource allocation of the multiple time resource allocationscorresponds to a different (e.g., unique) starting OFDM symbol, adifferent (e.g., unique) length of consecutive OFDM symbols and/or adifferent (e.g., unique) mapping type. For example, a time resourceallocation of the multiple time resource allocations (and/or each timeresource allocation of the multiple time resource allocations) maycorrespond to a starting OFDM symbol that is different from otherstarting OFDM symbols corresponding to other time resource allocationsof the multiple time resource allocations. Alternatively and/oradditionally, a time resource allocation of the multiple time resourceallocations (and/or each time resource allocation of the multiple timeresource allocations) may correspond to a length of consecutive OFDMsymbols that is different from other lengths of consecutive OFDM symbolscorresponding to other time resource allocations of the multiple timeresource allocations. Alternatively and/or additionally, a time resourceallocation of the multiple time resource allocations (and/or each timeresource allocation of the multiple time resource allocations) maycorrespond to a mapping type that is different from other mapping typescorresponding to other time resource allocations of the multiple timeresource allocations.

In one embodiment, time resource allocations of the one or more timeresource allocations (e.g., all time resource allocations of the one ormore time resource allocations) correspond to a same starting OFDMsymbol, a same length of consecutive OFDM symbols and/or a same mappingtype. For example, each time resource allocation of the one or more timeresource allocations corresponds to the same starting OFDM symbol, thesame length of consecutive OFDM symbols and/or the same mapping type.

In one embodiment, time resource allocations of the one or more timeresource allocations (e.g., all time resource allocations of the one ormore time resource allocations) correspond to different slots and/ordifferent time occasions. For example, the one or more time resourceallocations may comprise multiple time resource allocations, whereintime resource allocations of the multiple time resource allocations(e.g., all time resource allocations of the multiple time resourceallocations) correspond to different slots and/or different timeoccasions. In an example, each time resource allocation of the multipletime resource allocations corresponds to a different (e.g., unique) slotand/or a different (e.g., unique) time occasion. For example, a timeresource allocation of the multiple time resource allocations (and/oreach time resource allocation of the multiple time resource allocations)may correspond to a slot that is different from other slotscorresponding to other time resource allocations of the multiple timeresource allocations. Alternatively and/or additionally, a time resourceallocation of the multiple time resource allocations (and/or each timeresource allocation of the multiple time resource allocations) maycorrespond to a time occasion that is different from other timeoccasions corresponding to other time resource allocations of themultiple time resource allocations.

In one embodiment, the aggregation factor (that the UE does not expectto be configured and/or indicated by the message, for example) isassociated with (e.g., used for) configuring consecutive transmissions,consecutive time occasions and/or consecutive slots for transmitting asingle TB. For example, the aggregation factor may be associated with(e.g., used for) configuring a number of transmissions of consecutivetransmissions of the single TB, a number of time occasions ofconsecutive time occasions for transmitting the single TB multipletimes, and/or a number of slots of consecutive slots for transmittingthe single TB multiple times.

In one embodiment, the aggregation factor (that the UE does not expectto be configured and/or indicated by the message, for example) isassociated with (e.g., used for) slot aggregation and/or transmissionaggregation for a single TB.

In one embodiment, the aggregation factor (that the UE does not expectto be configured and/or indicated by the message, for example) isassociated with (e.g., used for) uplink transmission.

In one embodiment, the aggregation factor (that the UE does not expectto be configured and/or indicated by the message, for example) isupdated based on RRC signaling (e.g., in response to receiving the RRCsignaling, the aggregation factor may be updated by setting theaggregation factor to a value indicated by the RRC signaling).

In one embodiment, the first parameter ispusch-TimeDomainAllocationListForMultiPUSCH-r16.

In one embodiment, the second parameter (that the UE does not expect tobe included in the message, for example) is pusch-AggregationFactor.

In one embodiment, the third parameter (that the list of entries doesnot comprise) is numberOfRepetitions-r16.

Referring back to FIGS. 3 and 4, in one exemplary embodiment of a UE,the device 300 includes a program code 312 stored in the memory 310. TheCPU 308 may execute program code 312 to enable the UE (i) to receive amessage associated with PUSCH parameter configuration, wherein themessage comprises a first parameter indicative of a list of entriesassociated with time resource allocation for multiple PUSCHs, whereinthe list does not comprise a third parameter for configuring a number ofrepetitions, and wherein the UE does not expect the message to comprisea second parameter that configures and/or indicates an aggregationfactor, (ii) to receive a DCI indicative of a first entry in the list,wherein the first entry is indicative of one or more time resourceallocations, and (iii) to perform one or more transmissions on one ormore time occasions, wherein a number of time occasions of the one ormore time occasions is based on a number of time resource allocations ofthe one or more time resource allocations. Furthermore, the CPU 308 canexecute the program code 312 to perform one, some and/or all of theabove-described actions and steps and/or others described herein.

FIG. 20 is a flow chart 2000 according to one exemplary embodiment fromthe perspective of a network. In step 2005, the network transmits, to aUE, a message associated with PUSCH parameter configuration (e.g., themessage is for configuring one or more PUSCH parameters). The network isnot allowed to concurrently (e.g., simultaneously) include both a firstparameter and a second parameter in the message. For example, thenetwork is not allowed to configure the message to concurrently (e.g.,simultaneously) comprise both the first parameter and the secondparameter. For example, the network is not configured to concurrently(e.g., simultaneously) include both the first parameter and the secondparameter in the message and/or the network is prevented and/orprohibited from concurrently (e.g., simultaneously) including both thefirst parameter and the second parameter in the message. For example,the network may not concurrently (e.g., simultaneously) include both thefirst parameter and the second parameter in the message. The messagecomprises either the first parameter or the second parameter. Forexample, the message comprises merely a single parameter of the firstparameter and the second parameter and the message does not compriseboth the first parameter and the second parameter. In some examples, themessage comprises one or more parameters (other than the singleparameter) and/or information in addition to the single parameter (e.g.,the single parameter is either the first parameter or the secondparameter). In an example, the message comprises the first parameter anddoes not comprise the second parameter. In an example, the messagecomprises the second parameter and does not comprise the firstparameter. The first parameter indicates (e.g., configures) a list ofentries associated with time resource allocation for multiple PUSCHs. Inan example, the UE may be configured with the list of entries using thefirst parameter. The list of entries does not comprise a third parameterfor configuring a number of repetitions. The second parameter configuresand/or indicates an aggregation factor. In step 2010, the networktransmits a DCI indicative of a first entry in the list, wherein thefirst entry is indicative of one or more time resource allocations. Instep 2015, the network performs one or more receptions on one or moretime occasions, wherein a number of time occasions of the one or moretime occasions is based on a number of time resource allocations of theone or more time resource allocations. In an example, the number of timeoccasions is equal to the number of time resource allocations.

In one embodiment, the network operates with shared spectrum channelaccess on a carrier and/or a cell. For example, the network operateswith shared spectrum channel access on the carrier and/or the cellduring a period of time in which the network transmits the message,transmits the DCI, and/or performs the one or more receptions.

In one embodiment, the message is a RRC message.

In one embodiment, the message is PUSCH-Config (e.g., PUSCH-Configinformation element).

In one embodiment, for each TB of a plurality of TBs, the one or morereceptions comprise a reception of the TB. For example, each TB of theplurality of TBs is received at least one time via the one or morereceptions. Alternatively and/or additionally, each TB of the pluralityof TBs is received merely one time via the one or more receptions.

In one embodiment, the one or more receptions comprise receiving TBs ofthe plurality of TBs (e.g., all TBs of the plurality of TBs) inconsecutive slots in time domain (e.g., slots that are contiguous witheach other).

In one embodiment, each TB of the plurality of TBs is associated with atime resource allocation of the one or more time resource allocations.For example, the one or more time resource allocations may comprisemultiple time resource allocations, wherein TBs of the plurality of TBs(e.g., all TBs of the plurality of TBs) are associated with timeresource allocations of the multiple time resource allocations,respectively (e.g., each TB of the plurality of TBs is associated witheach time resource allocation of the multiple time resource allocations,respectively). In an example, each TB of the plurality of TBs may beassociated with a different time resource allocation of the multipletime resource allocations. For example, each TB of the plurality of TBsis associated with a time resource allocation, of the multiple timeresource allocations, that is different from other time resourceallocations (of the multiple time resource allocations) associated withother TBs of the plurality of TBs. For example, at least one of a firstTB of the plurality of TBs may be associated with a first time resourceallocation of the multiple time resource allocations, a second TB of theplurality of TBs may be associated with a second time resourceallocation of the multiple time resource allocations (wherein the secondtime resource allocation is different from the first time resourceallocation), etc.

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations corresponds toa starting OFDM symbol, a length of consecutive OFDM symbols and/or amapping type.

In one embodiment, a time occasion of the one or more time occasions(and/or each time occasion of the one or more time occasions) is a slot,a mini-slot, a resource associated with a time resource allocation(e.g., one time resource allocation) of the one or more time resourceallocations, and/or a PUSCH.

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations corresponds toa SLIV. For example, the time resource allocation may correspond to aSLIV index/number (e.g., one SLIV index/number, such as a SLIV indexcorresponding to the SLIV and/or a SLIV number corresponding to theSLIV).

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations corresponds toa SLIV and a mapping type.

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations indicates oneor more symbols (e.g., one or more consecutive symbols) in a slot (e.g.,a reception of the one or more receptions may be performed via the oneor more symbols based on the time resource allocation).

In one embodiment, a time resource allocation (e.g., one time resourceallocation) of the one or more time resource allocations is configuredby a PUSCH-Allocation-r16 (e.g., one PUSCH-Allocation-r16).

In one embodiment, the list is associated with time resource allocationfor uplink transmission. For example, the list may be used forindicating time resource allocations for uplink transmission.

In one embodiment, each entry in the list indicates (e.g., comprises) atmost a threshold number of time resource allocations. In an example, thethreshold number of time resource allocations is eight.

In one embodiment, time resource allocations of the one or more timeresource allocations (e.g., all time resource allocations of the one ormore time resource allocations) correspond to different starting OFDMsymbols, different lengths of consecutive OFDM symbols and/or differentmapping types. For example, the one or more time resource allocationsmay comprise multiple time resource allocations, wherein time resourceallocations of the multiple time resource allocations (e.g., all timeresource allocations of the multiple time resource allocations)correspond to different starting OFDM symbols, different lengths ofconsecutive OFDM symbols and/or different mapping types. In an example,each time resource allocation of the multiple time resource allocationscorresponds to a different (e.g., unique) starting OFDM symbol, adifferent (e.g., unique) length of consecutive OFDM symbols and/or adifferent (e.g., unique) mapping type. For example, a time resourceallocation of the multiple time resource allocations (and/or each timeresource allocation of the multiple time resource allocations) maycorrespond to a starting OFDM symbol that is different from otherstarting OFDM symbols corresponding to other time resource allocationsof the multiple time resource allocations. Alternatively and/oradditionally, a time resource allocation of the multiple time resourceallocations (and/or each time resource allocation of the multiple timeresource allocations) may correspond to a length of consecutive OFDMsymbols that is different from other lengths of consecutive OFDM symbolscorresponding to other time resource allocations of the multiple timeresource allocations. Alternatively and/or additionally, a time resourceallocation of the multiple time resource allocations (and/or each timeresource allocation of the multiple time resource allocations) maycorrespond to a mapping type that is different from other mapping typescorresponding to other time resource allocations of the multiple timeresource allocations.

In one embodiment, time resource allocations of the one or more timeresource allocations (e.g., all time resource allocations of the one ormore time resource allocations) correspond to a same starting OFDMsymbol, a same length of consecutive OFDM symbols and/or a same mappingtype. For example, each time resource allocation of the one or more timeresource allocations corresponds to the same starting OFDM symbol, thesame length of consecutive OFDM symbols and/or the same mapping type.

In one embodiment, time resource allocations of the one or more timeresource allocations (e.g., all time resource allocations of the one ormore time resource allocations) correspond to different slots and/ordifferent time occasions. For example, the one or more time resourceallocations may comprise multiple time resource allocations, whereintime resource allocations of the multiple time resource allocations(e.g., all time resource allocations of the multiple time resourceallocations) correspond to different slots and/or different timeoccasions. In an example, each time resource allocation of the multipletime resource allocations corresponds to a different (e.g., unique) slotand/or a different (e.g., unique) time occasion. For example, a timeresource allocation of the multiple time resource allocations (and/oreach time resource allocation of the multiple time resource allocations)may correspond to a slot that is different from other slotscorresponding to other time resource allocations of the multiple timeresource allocations. Alternatively and/or additionally, a time resourceallocation of the multiple time resource allocations (and/or each timeresource allocation of the multiple time resource allocations) maycorrespond to a time occasion that is different from other timeoccasions corresponding to other time resource allocations of themultiple time resource allocations.

In one embodiment, the aggregation factor is associated with (e.g., usedfor) configuring consecutive transmissions, consecutive time occasionsand/or consecutive slots for transmitting a single TB. For example, theaggregation factor may be associated with (e.g., used for) configuring anumber of transmissions of consecutive transmissions of the single TB, anumber of time occasions of consecutive time occasions for transmittingthe single TB multiple times, and/or a number of slots of consecutiveslots for transmitting the single TB multiple times.

In one embodiment, the aggregation factor is associated with (e.g., usedfor) slot aggregation and/or transmission aggregation for a single TB.

In one embodiment, the aggregation factor is associated with (e.g., usedfor) uplink transmission.

In one embodiment, the aggregation factor is updated based on RRCsignaling (e.g., the aggregation factor may be updated by setting theaggregation factor to a value indicated by the RRC signaling).

In one embodiment, the first parameter ispusch-TimeDomainAllocationListForMultiPUSCH-r16.

In one embodiment, the second parameter is pusch-AggregationFactor.

In one embodiment, the third parameter (that the list of entries doesnot comprise) is numberOfRepetitions-r16.

Referring back to FIGS. 3 and 4, in one exemplary embodiment of anetwork, the device 300 includes a program code 312 stored in the memory310. The CPU 308 may execute program code 312 to enable the network (i)to transmit, to a UE, a message associated with PUSCH parameterconfiguration, wherein the network is not allowed to concurrentlyinclude both a first parameter and a second parameter in the message,wherein the message comprises either the first parameter or the secondparameter, wherein the first parameter is indicative of a list ofentries associated with time resource allocation for multiple PUSCHs,wherein the list of entries does not comprise a third parameter forconfiguring a number of repetitions, and wherein the second parameterconfigures and/or indicates an aggregation factor, (ii) to transmit aDCI indicative of a first entry in the list, wherein the first entry isindicative of one or more time resource allocations, and (iii) toperform one or more receptions on one or more time occasions, wherein anumber of time occasions of the one or more time occasions is based on anumber of time resource allocations of the one or more time resourceallocations. Furthermore, the CPU 308 can execute the program code 312to perform one, some and/or all of the above-described actions and stepsand/or others described herein.

FIG. 21 is a flow chart 2100 according to one exemplary embodiment fromthe perspective of a UE. In step 2105, the UE receives a messageassociated with PUSCH parameter configuration (e.g., the message is forconfiguring one or more PUSCH parameters). The message comprises a firstparameter and a second parameter. In some examples, the messagecomprises one or more parameters (other than the first and secondparameter) and/or information in addition to the first and secondparameter. The first parameter indicates (e.g., configures) a first listof entries associated with time resource allocation for multiple PUSCHs.In an example, the UE may be configured with the first list of entriesusing the first parameter. The second parameter indicates (e.g.,configures) transmission of multiple repetitions for a single TB (e.g.,the second parameter indicates multiple repetitions of transmitting asingle TB). In step 2110, the UE receives a DCI indicative of a firstentry in the first list, wherein the first entry is indicative of one ormore time resource allocations. In step 2115, the UE performs one ormore transmissions on one or more time occasions, wherein a number oftime occasions of the one or more time occasions is based on a number oftime resource allocations of the one or more time resource allocations.In an example, the number of time occasions is equal to the number oftime resource allocations. In an example, the UE performs the one ormore transmissions to a network.

In one embodiment, the message is a RRC message.

In one embodiment, the UE performs the one or more transmissions (e.g.,one or more TB transmissions) on the one or more time occasions withoutapplying the multiple repetitions associated with the second parameter.Alternatively and/or additionally, the UE may not apply the multiplerepetitions associated with the second parameter for performing the oneor more transmissions on the one or more time occasions. Alternativelyand/or additionally, the UE may ignore the multiple repetitionsassociated with the second parameter for performing the one or moretransmissions on the one or more time occasions. Alternatively and/oradditionally, the UE may determine (e.g., consider) a number ofrepetitions for a single TB to be one for performing the one or moretransmissions on the one or more time occasions (e.g., the UE may nottransmit a single TB more than once via the one or more transmissions).Alternatively and/or additionally, the one or more transmissions may notcomprise a time occasion for TB repetition. Alternatively and/oradditionally, the UE may determine (e.g., consider) a number ofrepetitions for a single TB to be one for each time resource allocationof the one or more time resource allocations.

In one embodiment, the DCI is DCI format 0_1.

In one embodiment, a number of repetitions of the multiple repetitionsfor the single TB corresponds to a number of time occasions (e.g., atotal number of time occasions) for the single TB. Alternatively and/oradditionally, if the number of the repetitions of the multiplerepetitions for the single TB is two, the number of time occasions(e.g., the total number of time occasions) for the single TB is two.Alternatively and/or additionally, a number of repetitions for a singleTB corresponds to a number of time occasions (e.g., a total number oftime occasions) for the single TB. Alternatively and/or additionally, ifthe number of the repetitions for a single TB is one, the number of timeoccasions (e.g., the total number of time occasions) for the single TBis one.

In one embodiment, the number of time occasions of the one or more timeoccasions is equal to (e.g., identical to) the number of time resourceallocations of the one or more time resource allocations. Alternativelyand/or additionally, the number of time occasions of the one or moretime occasions is determined to be the number of time resourceallocations of the one or more time resource allocations

In one embodiment, the one or more time occasions do not comprise a timeoccasion associated with the multiple repetitions associated with thesecond parameter. Alternatively and/or additionally, the number of timeoccasions of the one or more time occasions is not based on the multiplerepetitions associated with the second parameter. Alternatively and/oradditionally, time occasions of the one or more time occasions maycorrespond to different TBs (e.g., each time occasion of the one or moretime occasions corresponds to a different TB, such as where a first timeoccasion corresponds to a first TB, a second time occasion correspondsto a second TB different than the first TB, etc.). Alternatively and/oradditionally, each time occasion of the one or more time occasions maybe without the multiple repetitions associated with the secondparameter. Alternatively and/or additionally, each time occasion of theone or more time occasions is associated with a repetition number equalto one. Alternatively and/or additionally, each time occasion of the oneor more time occasions may not be associated with the multiplerepetitions associated with the second parameter.

In one embodiment, for each TB of a plurality of TBs, the one or more TBtransmissions comprise a transmission of the TB. Alternatively and/oradditionally, the one or more TB transmissions may comprise transmittingTBs of the plurality of TBs in different slots. Alternatively and/oradditionally, each TB of the plurality of TBs may be associated with atime resource allocation of the one or more time resource allocations

In one embodiment, time resource allocations of the one or more timeresource allocations (e.g., all time resource allocations of the one ormore time resource allocations) correspond to different starting OFDMsymbols, different lengths of consecutive OFDM symbols and/or differentmapping types. For example, the one or more time resource allocationsmay comprise multiple time resource allocations, wherein time resourceallocations of the multiple time resource allocations (e.g., all timeresource allocations of the multiple time resource allocations)correspond to different starting OFDM symbols, different lengths ofconsecutive OFDM symbols and/or different mapping types. In an example,each time resource allocation of the multiple time resource allocationscorresponds to a different (e.g., unique) starting OFDM symbol, adifferent (e.g., unique) length of consecutive OFDM symbols and/or adifferent (e.g., unique) mapping type. For example, a time resourceallocation of the multiple time resource allocations (and/or each timeresource allocation of the multiple time resource allocations) maycorrespond to a starting OFDM symbol that is different from otherstarting OFDM symbols corresponding to other time resource allocationsof the multiple time resource allocations. Alternatively and/oradditionally, a time resource allocation of the multiple time resourceallocations (and/or each time resource allocation of the multiple timeresource allocations) may correspond to a length of consecutive OFDMsymbols that is different from other lengths of consecutive OFDM symbolscorresponding to other time resource allocations of the multiple timeresource allocations. Alternatively and/or additionally, a time resourceallocation of the multiple time resource allocations (and/or each timeresource allocation of the multiple time resource allocations) maycorrespond to a mapping type that is different from other mapping typescorresponding to other time resource allocations of the multiple timeresource allocations.

In one embodiment, time resource allocations of the one or more timeresource allocations (e.g., all time resource allocations of the one ormore time resource allocations) correspond to a same starting OFDMsymbol, a same length of consecutive OFDM symbols and/or a same mappingtype. For example, each time resource allocation of the one or more timeresource allocations corresponds to the same starting OFDM symbol, thesame length of consecutive OFDM symbols and/or the same mapping type.

In one embodiment, time resource allocations of the one or more timeresource allocations (e.g., all time resource allocations of the one ormore time resource allocations) correspond to different slots and/ordifferent time occasions. For example, the one or more time resourceallocations may comprise multiple time resource allocations, whereintime resource allocations of the multiple time resource allocations(e.g., all time resource allocations of the multiple time resourceallocations) correspond to different slots and/or different timeoccasions. In an example, each time resource allocation of the multipletime resource allocations corresponds to a different (e.g., unique) slotand/or a different (e.g., unique) time occasion. For example, a timeresource allocation of the multiple time resource allocations (and/oreach time resource allocation of the multiple time resource allocations)may correspond to a slot that is different from other slotscorresponding to other time resource allocations of the multiple timeresource allocations. Alternatively and/or additionally, a time resourceallocation of the multiple time resource allocations (and/or each timeresource allocation of the multiple time resource allocations) maycorrespond to a time occasion that is different from other timeoccasions corresponding to other time resource allocations of themultiple time resource allocations.

In one embodiment, the first list is associated with time resourceallocation for uplink transmission. Alternatively and/or additionally,each entry in the first list may be indicative of at most eight timeresource allocations. Alternatively and/or additionally, time resourceallocations of the one or more time resource allocations may correspondto different starting OFDM symbols, different lengths of consecutiveOFDM symbols and/or different mapping types. Alternatively and/oradditionally, time resource allocations of the one or more time resourceallocations may correspond to a same starting OFDM symbol, a same lengthof consecutive OFDM symbols and/or a same mapping type. Alternativelyand/or additionally, time resource allocations of the one or more timeresource allocations may correspond to different slots and/or differenttime occasions.

In one embodiment, the second parameter is pusch-AggregationFactor.Alternatively and/or additionally, the multiple repetitions isassociated with configuring consecutive transmissions (e.g., consecutivetransmissions for transmitting a single TB), consecutive time occasions(e.g., consecutive time occasions for transmitting a single TB) orconsecutive slots (e.g., consecutive slots for transmitting a singleTB). Alternatively and/or additionally, the multiple repetitions isassociated with slot aggregation and/or transmission aggregation for asingle TB. Alternatively and/or additionally, the multiple repetitionsis associated with uplink transmission. Alternatively and/oradditionally, the multiple repetitions is updated based on RRCsignaling.

In one embodiment, the message comprises a third parameter indicative ofa second list of entries associated with time resource allocation,wherein each entry in the second list is indicative of a single timeresource allocation. Alternatively and/or additionally, the UE mayreceive a second DCI indicative of an entry in the second list, and theUE may perform one or more transmissions on one or more time occasions,wherein a number of time occasions of the one or more time occasions isbased on the second parameter. Alternatively and/or additionally, thesecond list is associated with time resource allocation for uplinktransmission.

In one embodiment, the UE performs the one or more transmissions on oneor more time occasions by applying the multiple repetitions associatedwith the second parameter. Alternatively and/or additionally, the UEapply the multiple repetitions associated with the second parameter forperforming the one or more transmissions on one or more time occasions.Alternatively and/or additionally, for performing the one or moretransmissions on one or more time occasions, the UE may determine (e.g.,consider) a number of repetitions for a single TB (of the one or moretransmissions, for example) to be a number of repetitions of themultiple repetitions associated with the second parameter. Alternativelyand/or additionally, the one or more transmissions may comprise timeoccasions for TB repetition. Alternatively and/or additionally, the UEmay determine (e.g., consider) a number of repetitions for a single TBto be a number of repetitions of the multiple repetitions associatedwith the second parameter.

In one embodiment, the number of time occasions of the one or more timeoccasions is equal to (e.g., identical) to the multiple repetitionsassociated with the second parameter (e.g., the number of time occasionsof the one or more time occasions is equal to a number of repetitions ofthe multiple repetitions). Alternatively and/or additionally, each timeoccasion of the one or more time occasions may be associated with a timeresource allocation signaled by the entry in the second list.Alternatively and/or additionally, each time occasion of the one or moretime occasions may correspond to the same TB

Referring back to FIGS. 3 and 4, in one exemplary embodiment of a UE,the device 300 includes a program code 312 stored in the memory 310. TheCPU 308 may execute program code 312 to enable the UE (i) to receive amessage associated with PUSCH parameter configuration, wherein themessage comprises a first parameter and a second parameter, wherein thefirst parameter is indicative of a first list of entries associated withtime resource allocation for multiple PUSCHs, and wherein the secondparameter indicates (e.g., configures) transmission of multiplerepetitions for a single TB (e.g., the second parameter indicatesmultiple repetitions of transmitting a single TB), (ii) to receive a DCIindicative of a first entry in the first list, wherein the first entryis indicative of one or more time resource allocations, and (iii) toperform one or more transmissions on one or more time occasions, whereina number of time occasions of the one or more time occasions is based ona number of time resource allocations of the one or more time resourceallocations. Furthermore, the CPU 308 can execute the program code 312to perform one, some and/or all of the above-described actions and stepsand/or others described herein.

FIG. 22 is a flow chart 2200 according to one exemplary embodiment fromthe perspective of a UE. In step 2205, the UE receives a messageassociated with PUSCH parameter configuration (e.g., the message is forconfiguring one or more PUSCH parameters). The message comprises a firstparameter, a second parameter and a third parameter. In some examples,the message comprises one or more parameters (other than the first,second and third parameter) and/or information in addition to the first,second and third parameter. The first parameter indicates (e.g.,configures) a first list of entries associated with time resourceallocation for multiple PUSCHs. In an example, the UE may be configuredwith the first list of entries using the first parameter. The secondparameter indicates (e.g., configures) transmission of multiplerepetitions for a single PUSCH (e.g., one PUSCH) (e.g., the secondparameter indicates multiple repetitions of transmitting a single TB).In an example, the UE may be configured with transmission of themultiple repetitions for a single PUSCH using the second parameter. Thethird parameter indicates (e.g., configures) a second list of entriesassociated with time resource allocation. In an example, the UE may beconfigured with the second list of entries using the third parameter.Each entry in the second list is indicative of a single time resourceallocation. The first list, the second list and/or the second parameter(and/or other information in addition to the first list, the second listand/or the second parameter) are used for determining a repetitionnumber (e.g., the repetition number may correspond to a repetitionnumber of PUSCH transmission). In an example, the UE determines arepetition number based on the second parameter and the first list orthe second list (or based on the first list or based on the second listand the second parameter) (e.g., the repetition number may correspond toa repetition number of PUSCH transmission). In step 2210, if the UEreceives a first DCI indicative of a first entry in the first list, theUE transmits a plurality of PUSCHs based on a plurality of time resourceallocations indicated by the first entry, wherein a first repetitionnumber for the plurality of PUSCHs is determined to be one (e.g., thefirst repetition number equal to one is for each PUSCH of the pluralityof PUSCHs, such as where the first repetition number corresponds to anumber of transmissions of each PUSCH of the plurality of PUSCHs). Instep 2215, if the UE receives a second DCI indicative of a second entryin the second list, the UE transmits one or more PUSCHs with repetitionbased on a single time resource allocation indicated by the secondentry, wherein a second repetition number for the one or more PUSCHs isdetermined based on the second parameter (e.g., the second repetitionnumber is for each PUSCH of the one or more PUSCHs, such as where thesecond repetition number corresponds to a number of transmissions ofeach PUSCH of the one or more PUSCHs).

In one embodiment, a number of PUSCHs of the plurality of PUSCHs isbased on a number of time resource allocations of the plurality of timeresource allocations. Alternatively and/or additionally, the number ofPUSCHs of the plurality of PUSCHs is equal to (e.g., identical to) anumber of time resource allocations of the plurality of time resourceallocations. Alternatively and/or additionally, the number of PUSCHs ofthe plurality of PUSCHs is determined to be the number of time resourceallocations of the plurality of time resource allocations.

In one embodiment, a number of PUSCHs of the one or more PUSCHs (withrepetition) is equal to (e.g., identical to) a number of repetitions ofthe multiple repetitions associated with the second parameter (e.g., themultiple repetitions signalled by the second parameter).

In one embodiment, the first DCI is DCI format 0_1.

In one embodiment, the second DCI is not DCI format 0_1.

In one embodiment, the first repetition number corresponds to a numberof time occasions (e.g., a total number of time occasions) for eachPUSCH of the plurality of PUSCHs. Alternatively and/or additionally, thesecond repetition number may correspond to a second number of timeoccasions (e.g., a total number of time occasions) for each PUSCH of theone or more PUSCHs.

In one embodiment, a repetition number for a PUSCH corresponds to anumber of time occasions (e.g., a total number of time occasions) forthe PUSCH. In an example, if the repetition number for the PUSCH is two,a number of time occasions (e.g., a total number of time occasions) forthe PUSCH is two.

In one embodiment, one PUSCH corresponds to one TB. Alternatively and/oradditionally, PUSCHs of the plurality of PUSCHs correspond to differentTBs (e.g., each PUSCH of the plurality of PUSCHs corresponds to adifferent TB, such as where a first PUSCH of the plurality of PUSCHscorresponds to a first TB, a second PUSCH of the plurality of PUSCHscorresponds to a second TB different than the first TB, etc.).Alternatively and/or additionally, PUSCHs of the plurality of PUSCHs areassociated with different Hybrid Automatic Repeat Request (HARQ) processnumbers (e.g., each PUSCH of the plurality of PUSCHs is associated witha different HARQ process number, such as where a first PUSCH of theplurality of PUSCHs is associated with a first HARQ process number, asecond PUSCH of the plurality of PUSCHs is associated with a second HARQprocess number different than the first HARQ process number, etc.).Alternatively and/or additionally, PUSCHs of the plurality of PUSCHs areassociated with time resource allocations of the plurality of timeresource allocations indicated by the first DCI (e.g., each PUSCH of theplurality of PUSCHs is associated with each time resource allocation ofthe plurality of time resource allocations indicated by the first DCI,respectively). Alternatively and/or additionally, each PUSCH of theplurality of PUSCHs is associated with (e.g., transmitted in) a timeoccasion. Alternatively and/or additionally, each PUSCH of the pluralityof PUSCHs is associated with (e.g., transmitted in) a slot.Alternatively and/or additionally, the UE transmits the plurality ofPUSCHs without applying the multiple repetitions associated with thesecond parameter (e.g., the UE may not transmit the plurality of PUSCHsbased upon the multiple repetitions and/or a number of repetitions ofthe multiple repetitions).

In one embodiment, each PUSCH of the one or more PUSCHs (withrepetition) corresponds to one TB. Alternatively and/or additionally,each PUSCH of the one or more PUSCHs is associated with a same HARQprocess number. Alternatively and/or additionally, each PUSCH of the oneor more PUSCHs is associated with (e.g., transmitted in) a timeoccasion. Alternatively and/or additionally, each PUSCH of the one ormore PUSCHs is associated to (e.g., transmitted in) a slot.Alternatively and/or additionally, each PUSCH of the one or more PUSCHswith repetition is associated with the single time resource allocation(e.g., the single time resource allocation signalled by the second DCI).

In one embodiment, a time resource allocation (e.g., the single timeresource allocation and/or a time resource allocation of the pluralityof time resource allocations) corresponds to a starting OFDM symbol, alength of consecutive OFDM symbols and/or a mapping type. Alternativelyand/or additionally, a time resource allocation (e.g., the single timeresource allocation and/or a time resource allocation of the pluralityof time resource allocations) corresponds to a SLIV. Alternativelyand/or additionally, a time resource allocation (e.g., the single timeresource allocation and/or a time resource allocation of the pluralityof time resource allocations) corresponds to a SLIV and a mapping type.

In one embodiment, the first list is associated with time resourceallocation for uplink transmission. Alternatively and/or additionally,the second list is associated with time resource allocation for uplinktransmission. Alternatively and/or additionally, each entry in the firstlist is indicative of at most eight time resource allocations.Alternatively and/or additionally, time resource allocations of theplurality of time resource allocations correspond to different startingOFDM symbols, different lengths of consecutive OFDM symbols and/ordifferent mapping types. Alternatively and/or additionally, timeresource allocations of the plurality of time resource allocationscorrespond to a same starting OFDM symbol, a same length of consecutiveOFDM symbols and/or a same mapping type. Alternatively and/oradditionally, time resource allocations of the plurality of timeresource allocations correspond to different slots and/or different timeoccasions.

In one embodiment, the second parameter is pusch-AggregationFactor.Alternatively and/or additionally, the multiple repetitions associatedwith the second parameter is associated with configuring consecutivetransmissions, consecutive time occasions and/or consecutive slots fortransmitting a single TB. Alternatively and/or additionally, themultiple repetitions is associated with slot aggregation and/ortransmission aggregation for a single TB. Alternatively and/oradditionally, the multiple repetitions is associated with uplinktransmission. Alternatively and/or additionally, the multiplerepetitions is updated based on RRC signaling (e.g., the multiplerepetitions may be updated to indicate an updated number of multiplerepetitions based on the RRC signaling).

Referring back to FIGS. 3 and 4, in one exemplary embodiment of a UE,the device 300 includes a program code 312 stored in the memory 310. TheCPU 308 may execute program code 312 to enable the UE (i) to receive amessage associated with PUSCH parameter configuration, wherein themessage comprises a first parameter, a second parameter, and a thirdparameter, wherein the first parameter is indicative of (e.g.,configures) a first list of entries associated with time resourceallocation for multiple PUSCHs, the second parameter indicates (e.g.,configures) transmission of multiple repetitions for a single PUSCH, andthe third parameter is indicative of a second list of entries associatedwith time resource allocation, wherein each entry in the second list isindicative of a single time resource allocation, and wherein the firstlist, the second list and/or the second parameter are used fordetermining a repetition number, (ii) to transmit, if the UE receives afirst DCI indicative of a first entry in the first list, a plurality ofPUSCHs based on a plurality of time resource allocations indicated bythe first entry, wherein a first repetition number for the plurality ofPUSCHs is determined to be one, and (iii) to transmit, if the UEreceives a second DCI indicative of a second entry in the second list,one or more PUSCHs with repetition based on a single time resourceallocation indicated by the second entry, wherein a second repetitionnumber for the one or more PUSCHs is determined based on the secondparameter. Furthermore, the CPU 308 can execute the program code 312 toperform one, some and/or all of the above-described actions and stepsand/or others described herein.

A communication device (e.g., a UE, a base station, a network, etc.) maybe provided, wherein the communication device may comprise a controlcircuit, a processor installed in the control circuit and/or a memoryinstalled in the control circuit and coupled to the processor. Theprocessor may be configured to execute a program code stored in thememory to perform method steps illustrated in FIGS. 18-22. Furthermore,the processor may execute the program code to perform one, some and/orall of the above-described actions and steps and/or others describedherein.

A computer-readable medium may be provided. The computer-readable mediummay be a non-transitory computer-readable medium. The computer-readablemedium may comprise a flash memory device, a hard disk drive, a disc(e.g., a magnetic disc and/or an optical disc, such as at least one of adigital versatile disc (DVD), a compact disc (CD), etc.), and/or amemory semiconductor, such as at least one of static random accessmemory (SRAM), dynamic random access memory (DRAM), synchronous dynamicrandom access memory (SDRAM), etc. The computer-readable medium maycomprise processor-executable instructions, that when executed causeperformance of one, some and/or all method steps illustrated in FIGS.18-22, and/or one, some and/or all of the above-described actions andsteps and/or others described herein.

It may be appreciated that applying one or more of the techniquespresented herein may result in one or more benefits including, but notlimited to, increased efficiency of communication between devices (e.g.,a UE and/or a network), such as by enabling the UE and/or the network tointerpret and/or determine time resource allocation for multi-TB PUSCHwith repetition number and/or slot aggregation for PUSCH. For example,by enabling the UE and/or the network to perform (e.g., correctlyperform) communication using multi-PUSCHs functionality and/or PUSCHaggregation/repetition functionality, the UE and the network maycommunicate with each other with at least one of less control signalingoverhead, improved PUSCH transmission reliability, etc.

Various aspects of the disclosure have been described above. It shouldbe apparent that the teachings herein may be embodied in a wide varietyof forms and that any specific structure, function, or both beingdisclosed herein is merely representative. Based on the teachings hereinone skilled in the art should appreciate that an aspect disclosed hereinmay be implemented independently of any other aspects and that two ormore of these aspects may be combined in various ways. For example, anapparatus may be implemented or a method may be practiced using anynumber of the aspects set forth herein. In addition, such an apparatusmay be implemented or such a method may be practiced using otherstructure, functionality, or structure and functionality in addition toor other than one or more of the aspects set forth herein. As an exampleof some of the above concepts, in some aspects concurrent channels maybe established based on pulse repetition frequencies. In some aspectsconcurrent channels may be established based on pulse position oroffsets. In some aspects concurrent channels may be established based ontime hopping sequences. In some aspects concurrent channels may beestablished based on pulse repetition frequencies, pulse positions oroffsets, and time hopping sequences.

Those of skill in the art would understand that information and signalsmay be represented using any of a variety of different technologies andtechniques. For example, data, instructions, commands, information,signals, bits, symbols, and chips that may be referenced throughout theabove description may be represented by voltages, currents,electromagnetic waves, magnetic fields or particles, optical fields orparticles, or any combination thereof.

Those of skill would further appreciate that the various illustrativelogical blocks, modules, processors, means, circuits, and algorithmsteps described in connection with the aspects disclosed herein may beimplemented as electronic hardware (e.g., a digital implementation, ananalog implementation, or a combination of the two, which may bedesigned using source coding or some other technique), various forms ofprogram or design code incorporating instructions (which may be referredto herein, for convenience, as “software” or a “software module”), orcombinations of both. To clearly illustrate this interchangeability ofhardware and software, various illustrative components, blocks, modules,circuits, and steps have been described above generally in terms oftheir functionality. Whether such functionality is implemented ashardware or software depends upon the particular application and designconstraints imposed on the overall system. Skilled artisans mayimplement the described functionality in varying ways for eachparticular application, but such implementation decisions should not beinterpreted as causing a departure from the scope of the presentdisclosure.

In addition, the various illustrative logical blocks, modules, andcircuits described in connection with the aspects disclosed herein maybe implemented within or performed by an integrated circuit (“IC”), anaccess terminal, or an access point. The IC may comprise a generalpurpose processor, a digital signal processor (DSP), an applicationspecific integrated circuit (ASIC), a field programmable gate array(FPGA) or other programmable logic device, discrete gate or transistorlogic, discrete hardware components, electrical components, opticalcomponents, mechanical components, or any combination thereof designedto perform the functions described herein, and may execute codes orinstructions that reside within the IC, outside of the IC, or both. Ageneral purpose processor may be a microprocessor, but in thealternative, the processor may be any conventional processor,controller, microcontroller, or state machine. A processor may also beimplemented as a combination of computing devices, e.g., a combinationof a DSP and a microprocessor, a plurality of microprocessors, one ormore microprocessors in conjunction with a DSP core, or any other suchconfiguration.

It is understood that any specific order or hierarchy of steps in anydisclosed process is an example of a sample approach. Based upon designpreferences, it is understood that the specific order or hierarchy ofsteps in the processes may be rearranged while remaining within thescope of the present disclosure. The accompanying method claims presentelements of the various steps in a sample order, and are not meant to belimited to the specific order or hierarchy presented.

The steps of a method or algorithm described in connection with theaspects disclosed herein may be embodied directly in hardware, in asoftware module executed by a processor, or in a combination of the two.A software module (e.g., including executable instructions and relateddata) and other data may reside in a data memory such as RAM memory,flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a harddisk, a removable disk, a CD-ROM, or any other form of computer-readablestorage medium known in the art. A sample storage medium may be coupledto a machine such as, for example, a computer/processor (which may bereferred to herein, for convenience, as a “processor”) such theprocessor can read information (e.g., code) from and write informationto the storage medium. A sample storage medium may be integral to theprocessor. The processor and the storage medium may reside in an ASIC.The ASIC may reside in user equipment. In the alternative, the processorand the storage medium may reside as discrete components in userequipment. Alternatively and/or additionally, in some aspects anysuitable computer-program product may comprise a computer-readablemedium comprising codes relating to one or more of the aspects of thedisclosure. In some aspects a computer program product may comprisepackaging materials.

While the disclosed subject matter has been described in connection withvarious aspects, it will be understood that the disclosed subject matteris capable of further modifications. This application is intended tocover any variations, uses or adaptation of the disclosed subject matterfollowing, in general, the principles of the disclosed subject matter,and including such departures from the present disclosure as come withinthe known and customary practice within the art to which the disclosedsubject matter pertains.

1. A method of a User Equipment (UE), the method comprising: receiving amessage associated with Physical Uplink Shared Channel (PUSCH) parameterconfiguration, wherein: at least one of: the message comprises a firstparameter indicative of a first list of entries associated with timeresource allocation for multiple PUSCHs; the message comprises a secondparameter indicative of transmission of multiple repetitions for asingle PUSCH; or the message comprises a third parameter indicative of asecond list of entries associated with time resource allocation, whereineach entry in the second list is indicative of a single time resourceallocation; and at least one of the first list, the second list or thesecond parameter are used for determining a repetition number; and atleast one of: transmitting, if the UE receives a first Downlink ControlInformation (DCI) indicative of a first entry in the first list, aplurality of PUSCHs based on a plurality of time resource allocationsindicated by the first entry, wherein a first repetition number for theplurality of PUSCHs is one; or transmitting, if the UE receives a secondDCI indicative of a second entry in the second list, one or more PUSCHswith repetition based on a single time resource allocation indicated bythe second entry, wherein a second repetition number for the one or morePUSCHs is based on the second parameter.
 2. The method of claim 1,wherein at least one of: a number of PUSCHs of the plurality of PUSCHsis based on a number of time resource allocations of the plurality oftime resource allocations; the number of PUSCHs of the plurality ofPUSCHs is equal to the number of time resource allocations of theplurality of time resource allocations; or the number of PUSCHs of theplurality of PUSCHs is the number of time resource allocations of theplurality of time resource allocations.
 3. The method of claim 1,wherein a number of PUSCHs of the one or more PUSCHs is equal to anumber of repetitions of the multiple repetitions associated with thesecond parameter.
 4. The method of claim 1, wherein at least one of: thefirst DCI is DCI format 0_1; or the second DCI is not DCI format 0_1. 5.The method of claim 1, wherein at least one of: the first repetitionnumber corresponds to a number of time occasions for each PUSCH of theplurality of PUSCHs; or the second repetition number corresponds to asecond number of time occasions for each PUSCH of the one or morePUSCHs.
 6. The method of claim 1, wherein at least one of: one PUSCHcorresponds to one Transport Block (TB); PUSCHs of the plurality ofPUSCHs correspond to different TBs; PUSCHs of the plurality of PUSCHsare associated with different Hybrid Automatic Repeat Request (HARQ)process numbers; PUSCHs of the plurality of PUSCHs are associated withtime resource allocations of the plurality of time resource allocationsindicated by the first DCI; each PUSCH of the plurality of PUSCHs isassociated with a time occasion; each PUSCH of the plurality of PUSCHsis associated with a slot; or the UE transmits the plurality of PUSCHswithout applying the multiple repetitions associated with the secondparameter.
 7. The method of claim 1, wherein at least one of: each PUSCHof the one or more PUSCHs corresponds to one Transport Block (TB); eachPUSCH of the one or more PUSCHs is associated with a same HybridAutomatic Repeat Request (HARQ) process number; each PUSCH of the one ormore PUSCHs is associated with a time occasion; each PUSCH of the one ormore PUSCHs is associated with a slot; or each PUSCH of the one or morePUSCHs is associated with the single time resource allocation indicatedby the second entry.
 8. The method of claim 1, wherein at least one of:a time resource allocation of the plurality of time resource allocationscorresponds to at least one of a starting Orthogonal Frequency DivisionMultiplexing (OFDM) symbol, a length of consecutive OFDM symbols or amapping type; a time resource allocation of the plurality of timeresource allocations corresponds to a start and length indicator value(SLIV); a time resource allocation of the plurality of time resourceallocations corresponds to a SLIV and a mapping type; the single timeresource allocation indicated by the second entry corresponds to atleast one of a starting OFDM symbol, a length of consecutive OFDMsymbols or a mapping type; the single time resource allocation indicatedby the second entry corresponds to a SLIV; or the single time resourceallocation indicated by the second entry corresponds to a SLIV and amapping type.
 9. The method of claim 1, wherein at least one of: thefirst list is associated with time resource allocation for uplinktransmission; the second list is associated with time resourceallocation for uplink transmission; each entry in the first list isindicative of at most eight time resource allocations; time resourceallocations of the plurality of time resource allocations correspond toat least one of different starting Orthogonal Frequency DivisionMultiplexing (OFDM) symbols, different lengths of consecutive OFDMsymbols or different mapping types; time resource allocations of theplurality of time resource allocations correspond to at least one of asame starting OFDM symbol, a same length of consecutive OFDM symbols ora same mapping type; or time resource allocations of the plurality oftime resource allocations correspond to at least one of different slotsor different time occasions.
 10. The method of claim 1, wherein at leastone of: the second parameter is pusch-AggregationFactor; the multiplerepetitions associated with the second parameter is associated withconfiguring at least one of consecutive transmissions, consecutive timeoccasions or consecutive slots for transmitting a single Transport Block(TB); the multiple repetitions is associated with at least one of slotaggregation or transmission aggregation for a single TB; the multiplerepetitions is associated with uplink transmission; or the multiplerepetitions is updated based on Radio Resource Control (RRC) signaling.11. A method for a User Equipment (UE), comprising: receiving aconfiguration, from a network, for configuring a list associated withtime resource allocation for multiple Physical Uplink Shared Channels(PUSCHs), wherein: the list comprises a first entry and a second entry;the first entry is indicative of a plurality of time resourceallocations without repetition; and the second entry indicates a singletime resource allocation with repetition; receiving a Downlink ControlInformation (DCI) indicative of an entry in the list; and performingfirst transmission based on the entry indicated by the DCI, wherein: ifthe entry indicated by the DCI is the first entry, the firsttransmission comprises transmitting a plurality of Transport Blocks(TBs) without repetition based on the plurality of time resourceallocations; and if the entry indicated by the DCI is the second entry,the first transmission comprises transmitting a single TB withrepetition based on the single time resource allocation.
 12. The methodof claim 11, wherein the transmitting the plurality of TBs withoutrepetition based on the plurality of time resource allocations comprisesperforming one or more transmissions on one or more time occasions,wherein a number of time occasions of the one or more time occasions isbased on a number of time resource allocations of the plurality of timeresource allocations.
 13. The method of claim 12, wherein at least oneof: for each TB of the plurality of TBs, the one or more transmissionscomprise a transmission of the TB; the one or more transmissionscomprise transmitting TBs of the plurality of TBs in consecutive slots;or each TB of the plurality of TBs is associated with a time resourceallocation of the plurality of time resource allocations.
 14. The methodof claim 11, wherein at least one of: time resource allocations of theplurality of time resource allocations correspond to at least one ofdifferent starting Orthogonal Frequency Division Multiplexing (OFDM)symbols, different lengths of consecutive OFDM symbols or differentmapping types; time resource allocations of the plurality of timeresource allocations correspond to at least one of a same starting OFDMsymbol, a same length of consecutive OFDM symbols or a same mappingtype; or time resource allocations of the plurality of time resourceallocations correspond to at least one of different slots or differenttime occasions.
 15. The method of claim 11, wherein the transmitting thesingle TB with repetition based on the single time resource allocationcomprises performing one or more transmissions on one or more timeoccasions, wherein a number of time occasions of the one or more timeoccasions is based on a repetition number.
 16. The method of claim 15,wherein at least one of: the repetition number is based on anaggregation factor; the aggregation factor is associated withconfiguring at least one of consecutive transmissions, consecutive timeoccasions or consecutive slots for transmitting a second single TB; theaggregation factor is associated with at least one of slot aggregationor transmission aggregation for a third single TB; or the aggregationfactor is associated with uplink transmission.
 17. The method of claim11, wherein at least one of: a time resource allocation of one or moretime resource allocations indicated by the list corresponds to at leastone of a starting Orthogonal Frequency Division Multiplexing (OFDM)symbol, a length of consecutive OFDM symbols or a mapping type; thefirst transmission comprises performing one or more transmissions on oneor more time occasions; a time occasion of the one or more timeoccasions is at least one of a slot, a mini-slot, a resource associatedwith a time resource allocation of the one or more time resourceallocations or a PUSCH; a time resource allocation of the one or moretime resource allocations corresponds to a start and length indicatorvalue (SLIV); a time resource allocation of the one or more timeresource allocations corresponds to a SLIV and a mapping type; or a timeresource allocation of the one or more time resource allocationsindicates one or more symbols in a slot.
 18. A User Equipment (UE),comprising: a control circuit; a processor installed in the controlcircuit; and a memory installed in the control circuit and operativelycoupled to the processor, wherein the processor is configured to executea program code stored in the memory to perform operations, theoperations comprising: receiving a message associated with PhysicalUplink Shared Channel (PUSCH) parameter configuration, wherein: at leastone of: the message comprises a first parameter indicative of a firstlist of entries associated with time resource allocation for multiplePUSCHs; the message comprises a second parameter indicative oftransmission of multiple repetitions for a single PUSCH; or the messagecomprises a third parameter indicative of a second list of entriesassociated with time resource allocation, wherein each entry in thesecond list is indicative of a single time resource allocation; and atleast one of the first list, the second list or the second parameter areused for determining a repetition number; and at least one of:transmitting, if the UE receives a first Downlink Control Information(DCI) indicative of a first entry in the first list, a plurality ofPUSCHs based on a plurality of time resource allocations indicated bythe first entry, wherein a first repetition number for the plurality ofPUSCHs is one; or transmitting, if the UE receives a second DCIindicative of a second entry in the second list, one or more PUSCHs withrepetition based on a single time resource allocation indicated by thesecond entry, wherein a second repetition number for the one or morePUSCHs is based on the second parameter.
 19. The UE of claim 18, whereinat least one of: a number of PUSCHs of the plurality of PUSCHs is basedon a number of time resource allocations of the plurality of timeresource allocations; the number of PUSCHs of the plurality of PUSCHs isequal to the number of time resource allocations of the plurality oftime resource allocations; or the number of PUSCHs of the plurality ofPUSCHs is the number of time resource allocations of the plurality oftime resource allocations.
 20. The UE of claim 18, wherein a number ofPUSCHs of the one or more PUSCHs is equal to a number of repetitions ofthe multiple repetitions indicated by the second parameter.